{"id":"https://openalex.org/W1493391054","doi":null,"title":"EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS","display_name":"EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS","publication_year":1987,"publication_date":"1987-02-01","ids":{"openalex":"https://openalex.org/W1493391054","mag":"1493391054"},"language":"en","primary_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/149641","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/149641","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/149641/1/MIT-LCS-TR-374.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dspace.mit.edu/bitstream/1721.1/149641/1/MIT-LCS-TR-374.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111783338","display_name":"Andrew V. Goldberg","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Andrew V. Goldberg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5111783338"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.3179,"has_fulltext":true,"cited_by_count":121,"citation_normalized_percentile":{"value":0.98820887,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"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.9976000189781189,"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.9976000189781189,"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.0017999999690800905,"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.00019999999494757503,"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/graph-algorithms","display_name":"graph algorithms","score":0.8730000257492065},{"id":"https://openalex.org/keywords/maximum-flow","display_name":"maximum flow","score":0.8709999918937683},{"id":"https://openalex.org/keywords/minimum-cost-flow","display_name":"minimum cost flow","score":0.8930000066757202},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.9520000219345093},{"id":"https://openalex.org/keywords/distributed-algorithms","display_name":"distributed algorithms","score":0.9919999837875366},{"id":"https://openalex.org/keywords/symmetry-breaking","display_name":"symmetry breaking","score":0.7570000290870667},{"id":"https://openalex.org/keywords/maximal-independent-sets","display_name":"maximal independent sets","score":0.8889999985694885},{"id":"https://openalex.org/keywords/planar-graph-coloring","display_name":"planar graph coloring","score":0.7519999742507935},{"id":"https://openalex.org/keywords/maximal-matching","display_name":"maximal matching","score":0.8569999933242798},{"id":"https://openalex.org/keywords/asynchronous-distributed-algorithms","display_name":"asynchronous distributed algorithms","score":0.5220000147819519}],"concepts":[{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.7078728675842285},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6559289693832397},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5983545780181885},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.56493079662323},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5625876784324646},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4428965151309967},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41097235679626465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.297168493270874},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21982714533805847},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:dspace.mit.edu:1721.1/149641","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/149641","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/149641/1/MIT-LCS-TR-374.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:ADA178403","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA178403","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:dspace.mit.edu:1721.1/14912","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/14912","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},{"id":"mag:1493391054","doi":null,"is_oa":false,"landing_page_url":"http://ci.nii.ac.jp/ncid/BB04002891","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":{"id":"pmh:oai:dspace.mit.edu:1721.1/149641","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/149641","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/149641/1/MIT-LCS-TR-374.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1493391054.pdf","grobid_xml":"https://content.openalex.org/works/W1493391054.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4285606607","https://openalex.org/W2014993890","https://openalex.org/W2007470648","https://openalex.org/W2044614658","https://openalex.org/W7097823629","https://openalex.org/W1569704573","https://openalex.org/W2109567578","https://openalex.org/W1888906176","https://openalex.org/W3015480687","https://openalex.org/W2032846330"],"abstract_inverted_index":{"In":[0],"this":[1],"thesis":[2],"we":[3,53,178],"study":[4],"graph":[5],"algorithms,":[6,238],"both":[7,98],"in":[8,23,202,248,259],"sequential":[9,78,167],"and":[10,43,94,97,100,162,173,243,254,276],"parallel":[11,87,172,182,192,237,268],"contexts.In":[12],"the":[13,17,26,31,36,44,59,69,108,118,127,130,135,147,210,215,267,271,277],"following":[14],"outline":[15],"of":[16,25,28,33,40,48,117,129,181,187,190,218,270,279],"thesis,":[18],"algorithm":[19,88,225,231],"complexities":[20],"are":[21,214],"stated":[22],"terms":[24],"number":[27,32],"vertices":[29],"n,":[30],"edges":[34],"m,":[35],"largest":[37,45],"absolute":[38,46],"value":[39,47],"capacities":[41],"U,":[42],"costs":[49],"C.In":[50],"Chapter":[51,176,219],"1":[52,155,159],"introduce":[54,122],"a":[55,115,123,185,191,228,256,281],"new":[56],"approach":[57],"to":[58,65,107,134,142,234],"maximum":[60,119,131,193],"flow":[61,111,120,132,137,149,194],"problem":[62,275,278],"that":[63,89,125],"leads":[64],"better":[66],"algorithms":[67,71,145,168,183,240],"for":[68,146,226,241],"problem.These":[70],"include":[72],"an":[73,80,188,199,223],"0(nmlog(n":[74],"2":[75,83,104,158],"/m))":[76],"time":[77,86,166],"algorithm,":[79],"0(":[81,91],"n":[82],"log":[84],"n)":[85,92],"uses":[90],"processors":[93],"0(m)":[95],"memory,":[96],"synchronous":[99],"asynchronous":[101],"distributed":[102,174],"algorithms.Chapter":[103],"is":[105,114,232],"devoted":[106],"minimum":[109],"cost":[110],"problem,":[112],"which":[113],"generalization":[116,128],"problem.We":[121,150],"framework":[124,139],"allows":[126,140],"techniques":[133,213],"minimum-cost":[136,148],"problem.This":[138],"us":[141],"design":[143],"efficient":[144],"exhibit":[151],"0(nmlog(n)log(nC)),":[152],"0(n":[153,163],"5":[154],"3":[156,160,164,177],"m":[157],"log(nC)),":[161],"log(nC))":[165],"as":[169,171],"well":[170],"algorithms.In":[175],"address":[179],"implementation":[180,189],"through":[184],"case-study":[186],"algorithm.Parallel":[195],"prefix":[196],"operations":[197],"play":[198],"important":[200],"role":[201],"our":[203],"implementation.We":[204],"present":[205],"experimental":[206],"results":[207],"achieved":[208],"by":[209],"implementation.Parallel":[211],"symmetry-breaking":[212],"main":[216],"topic":[217],"4.":[220],"We":[221],"give":[222],"0(lg*n)":[224],"3-coloring":[227],"rooted":[229,282],"tree.This":[230],"used":[233],"improve":[235],"several":[236],"including":[239],"~+1-coloring":[242],"finding":[244,255],"maximal":[245,257,272],"independent":[246,273],"set":[247,274],"constant-degree":[249],"graphs,":[250,253],"5-coloring":[251],"planar":[252,260],"matching":[258],"graphs.We":[261],"also":[262],"prove":[263],"lower":[264],"bounds":[265],"on":[266],"complexity":[269],"2-coloring":[280],"tree.":[283]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}