{"id":"https://openalex.org/W1525859652","doi":null,"title":"Communication-Efficient Parallel Graph Algorithms.","display_name":"Communication-Efficient Parallel Graph Algorithms.","publication_year":1986,"publication_date":"1986-01-01","ids":{"openalex":"https://openalex.org/W1525859652","mag":"1525859652"},"language":"en","primary_location":{"id":"pmh:ADA178286","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA178286","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":true,"oa_status":"green","oa_url":"https://hdl.handle.net/1721.1/149126","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027618658","display_name":"Charles E. Leiserson","orcid":"https://orcid.org/0000-0001-6386-5552","observed_orcids":["https://orcid.org/0000-0001-6386-5552"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Charles E. Leiserson","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-6386-5552","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5046808993","display_name":"Bruce MacDowell Maggs","orcid":"https://orcid.org/0000-0002-5692-7062","observed_orcids":["https://orcid.org/0000-0002-5692-7062"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bruce M. Maggs","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-5692-7062","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6757,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.88787522,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"87","issue":null,"first_page":"23853","last_page":"868"},"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.5414999723434448,"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.5414999723434448,"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.4018999934196472,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.03920000046491623,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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-graph-algorithms","display_name":"parallel graph algorithms","score":0.8939999938011169},{"id":"https://openalex.org/keywords/communication-efficiency","display_name":"communication efficiency","score":0.8489999771118164},{"id":"https://openalex.org/keywords/communication-bandwidth","display_name":"communication bandwidth","score":0.7409999966621399},{"id":"https://openalex.org/keywords/pram","display_name":"PRAM","score":0.5009999871253967},{"id":"https://openalex.org/keywords/tree-contraction","display_name":"tree contraction","score":0.7919999957084656}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8239209651947021},{"id":"https://openalex.org/C7366592","wikidata":"https://www.wikidata.org/wiki/Q1255620","display_name":"Dram","level":2,"score":0.6534539461135864},{"id":"https://openalex.org/C156891508","wikidata":"https://www.wikidata.org/wiki/Q1004114","display_name":"Bulk synchronous parallel","level":3,"score":0.6157307028770447},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.5650563836097717},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4936762750148773},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46712926030158997},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4596002697944641},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45759138464927673},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.4302191138267517},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.4226821959018707},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4138891398906708},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4127028286457062},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4080963730812073},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39778032898902893},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21676459908485413},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:ADA178286","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA178286","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/149126","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/149126","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":null},{"id":"mag:1525859652","doi":null,"is_oa":false,"landing_page_url":"https://apps.dtic.mil/docs/citations/ADA178286","pdf_url":null,"source":{"id":"https://openalex.org/S4306520500","display_name":"NASA STI/Recon Technical Report N","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":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"NASA STI/Recon Technical Report N","raw_type":null},{"id":"mag:3173410517","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/icpp/icpp1986.html#LeisersonM86","pdf_url":null,"source":{"id":"https://openalex.org/S4210174133","display_name":"Proceedings of the International Conference on Parallel Processing","issn_l":"0190-3918","issn":["0190-3918","2332-5690"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the International Conference on Parallel Processing","raw_type":null}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/149126","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/149126","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":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/W28243696","https://openalex.org/W1971262016","https://openalex.org/W1558815430","https://openalex.org/W1894040992","https://openalex.org/W2048487439","https://openalex.org/W2155209532","https://openalex.org/W3169630860","https://openalex.org/W7120333577","https://openalex.org/W70164100","https://openalex.org/W17580785"],"abstract_inverted_index":{"Communication":[0],"bandwidth":[1],"is":[2,61],"a":[3,49,82],"resource":[4],"ignored":[5],"by":[6],"most":[7],"parallel":[8],"random-access":[9,54],"machine":[10,55],"(PRAM)":[11],"models.":[12],"This":[13],"paper":[14],"shows":[15],"that":[16],"many":[17],"graph":[18],"problems":[19],"can":[20],"be":[21],"solved":[22],"in":[23,48,57,63],"parallel,":[24],"not":[25],"only":[26],"with":[27,31],"polylogarithmic":[28],"performance,":[29],"but":[30],"efficient":[32],"communication":[33,43,59],"at":[34],"each":[35],"step":[36],"of":[37,45,65,68,73,85],"the":[38,42,52,66,86],"computation.":[39],"We":[40],"measure":[41],"requirements":[44],"an":[46,74],"algorithm":[47],"model":[50],"called":[51],"distributed":[53],"(DRAM),":[56],"whcih":[58],"cost":[60],"measured":[62],"terms":[64],"congestion":[67],"memory":[69],"access":[70],"across":[71],"cuts":[72],"underlying":[75],"network.":[76],"The":[77],"algorithms":[78],"are":[79],"based":[80],"on":[81],"communication-efficient":[83],"variant":[84],"tree":[87],"contraction":[88],"technique":[89],"due":[90],"to":[91],"Miller":[92],"and":[93],"Reif.":[94]},"counts_by_year":[],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}