{"id":"https://openalex.org/W1493041473","doi":null,"title":"Parallel Algorithms for Graph Theoretic Problems","display_name":"Parallel Algorithms for Graph Theoretic Problems","publication_year":1977,"publication_date":"1977-08-01","ids":{"openalex":"https://openalex.org/W1493041473","mag":"1493041473"},"language":"en","primary_location":{"id":"pmh:ADA056888","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA056888","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029085327","display_name":"Carla D. Savage","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Carla D. Savage","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5029085327"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.736,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.80414079,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9779999852180481,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9779999852180481,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.019700000062584877,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.0008999999845400453,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.9760000109672546},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.9340000152587891},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.7310000061988831},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"minimum spanning tree","score":0.7149999737739563},{"id":"https://openalex.org/keywords/biconnected-components","display_name":"biconnected components","score":1.0},{"id":"https://openalex.org/keywords/bridges","display_name":"bridges","score":0.9240000247955322},{"id":"https://openalex.org/keywords/cycles","display_name":"cycles","score":0.7409999966621399},{"id":"https://openalex.org/keywords/cycle-bases","display_name":"cycle bases","score":0.9959999918937683},{"id":"https://openalex.org/keywords/shortest-cycle","display_name":"shortest cycle","score":0.9160000085830688},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.6779999732971191}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5930547118186951},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5028409361839294},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4828813374042511},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4680715799331665},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4636479616165161},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45898211002349854},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4150829315185547},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.384662002325058},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38094019889831543},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3786311745643616},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:ADA056888","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA056888","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"},{"id":"pmh:oai:www.ideals.illinois.edu:2142/75699","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/2142/75699","pdf_url":null,"source":{"id":"https://openalex.org/S4306401358","display_name":"Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801919071","host_organization_name":"University of Illinois System","host_organization_lineage":["https://openalex.org/I2801919071"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:1493041473","doi":null,"is_oa":false,"landing_page_url":"https://apps.dtic.mil/dtic/tr/fulltext/u2/a056888.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W70164100","https://openalex.org/W2898430265","https://openalex.org/W7099957343","https://openalex.org/W2591148187","https://openalex.org/W4400190136","https://openalex.org/W2504493224","https://openalex.org/W2743039732","https://openalex.org/W2507743767","https://openalex.org/W2076686573","https://openalex.org/W2100352043"],"abstract_inverted_index":{"The":[0,102],"existence":[1],"of":[2,9,29,47,64,68,79,104,118,140,158],"parallel":[3,10,27],"computers":[4],"has":[5],"motivated":[6],"the":[7,56,80,134,145],"development":[8],"problems":[11,23,38,82],"solving":[12,21],"techniques":[13],"for":[14,20,60,83],"many":[15],"problems.":[16,143],"Techniques":[17],"are":[18,74,152],"studied":[19],"graph":[22,37,142],"on":[24,133],"an":[25,61],"unbounded":[26],"model":[28],"computation.":[30],"It":[31,120],"is":[32,111,121,129],"shown":[33,122],"that":[34,123],"solutions":[35],"to":[36,42,53,76,107,137,154],"can":[39,50],"be":[40,51],"organized":[41],"reveal":[43],"a":[44,115,130,156],"large":[45],"amount":[46],"parallelism,":[48],"which":[49,151],"exploited":[52],"substantially":[54],"reduce":[55],"computation":[57],"time.":[58],"Precisely,":[59],"appropriate":[62],"measure":[63],"time":[65,69,135,149],"complexity,":[66],"algorithms":[67,146],"complexity":[70],"0":[71],"log-squared":[72],"n":[73,86,126],"developed":[75],"solve":[77,138],"each":[78,109,139],"following":[81],"graphs":[84],"with":[85],"vertices:":[87],"finding":[88],"minimum":[89],"spanning":[90],"trees,":[91],"biconnected":[92],"components,":[93],"dominators,":[94],"bridges,":[95],"cycles,":[96],"cycle":[97],"bases,":[98],"and":[99],"shortest":[100],"cycles.":[101],"number":[103],"processors":[105],"needed":[106],"execute":[108],"algorithm":[110],"bounded":[112],"above":[113],"by":[114],"polynomial":[116],"function":[117],"n.":[119,160],"2":[124],"log":[125,159],"+":[127],"c":[128],"lower":[131],"bound":[132],"required":[136],"these":[141],"Thus,":[144],"obtained":[147],"have":[148],"complexities":[150],"optimal":[153],"within":[155],"factor":[157]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}