{"id":"https://openalex.org/W2074214908","doi":"https://doi.org/10.1145/800193.569966","title":"Computing minimum spanning trees efficiently","display_name":"Computing minimum spanning trees efficiently","publication_year":1972,"publication_date":"1972-01-01","ids":{"openalex":"https://openalex.org/W2074214908","doi":"https://doi.org/10.1145/800193.569966","mag":"2074214908"},"language":"en","primary_location":{"id":"doi:10.1145/800193.569966","doi":"https://doi.org/10.1145/800193.569966","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800193.569966","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800193.569966","source":{"id":"https://openalex.org/S7407089072","display_name":"ACM Annual Conference","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM annual conference on - ACM'72","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/800193.569966","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044239463","display_name":"Aaron Kershenbaum","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Kershenbaum","raw_affiliation_strings":["Network Analysis Corp"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Network Analysis Corp","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048788904","display_name":"Richard Van Slyke","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Van Slyke","raw_affiliation_strings":["Network Analysis Corp"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Network Analysis Corp","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.0541,"has_fulltext":true,"cited_by_count":83,"citation_normalized_percentile":{"value":0.96629213,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":98},"biblio":{"volume":"1","issue":null,"first_page":"518","last_page":"518"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/minimum-spanning-tree","display_name":"minimum spanning tree","score":0.8980000019073486},{"id":"https://openalex.org/keywords/kruskal-s-algorithm","display_name":"Kruskal's algorithm","score":0.996999979019165},{"id":"https://openalex.org/keywords/prim-s-algorithm","display_name":"Prim's algorithm","score":1.0},{"id":"https://openalex.org/keywords/sparse-networks","display_name":"sparse networks","score":0.7120000123977661},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.6349999904632568},{"id":"https://openalex.org/keywords/algorithmic-efficiency","display_name":"algorithm efficiency","score":0.5899999737739563},{"id":"https://openalex.org/keywords/network-sparseness","display_name":"network sparseness","score":0.6840000152587891},{"id":"https://openalex.org/keywords/algorithm-comparison","display_name":"algorithm comparison","score":0.33899998664855957}],"concepts":[{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.9564347267150879},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.8826028108596802},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.834144651889801},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.819724977016449},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.7955222129821777},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.7733633518218994},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5928866863250732},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5647903680801392},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5427366495132446},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5411211252212524},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5227720141410828},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.48834940791130066},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4537901282310486},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4483107030391693},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.44745558500289917},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4242498576641083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3909730613231659},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3604692816734314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3591931462287903},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3269560635089874},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3084096908569336},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2829405665397644}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/800193.569966","doi":"https://doi.org/10.1145/800193.569966","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800193.569966","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800193.569966","source":{"id":"https://openalex.org/S7407089072","display_name":"ACM Annual Conference","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM annual conference on - ACM'72","raw_type":"proceedings-article"},{"id":"doi:10.1145/569961.569966","doi":"https://doi.org/10.1145/569961.569966","is_oa":false,"landing_page_url":"https://doi.org/10.1145/569961.569966","pdf_url":null,"source":{"id":"https://openalex.org/S7407089072","display_name":"ACM Annual Conference","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM annual conference on - ACM'72","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/800193.569966","doi":"https://doi.org/10.1145/800193.569966","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800193.569966","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800193.569966","source":{"id":"https://openalex.org/S7407089072","display_name":"ACM Annual Conference","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM annual conference on - ACM'72","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306078","display_name":"U.S. Department of Defense","ror":"https://ror.org/0447fe631"},{"id":"https://openalex.org/F4320332815","display_name":"Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2074214908.pdf","grobid_xml":"https://content.openalex.org/works/W2074214908.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W108464071","https://openalex.org/W245863375","https://openalex.org/W1965680834","https://openalex.org/W1968778433","https://openalex.org/W1972969203","https://openalex.org/W1985825468","https://openalex.org/W1991528957","https://openalex.org/W1991983920","https://openalex.org/W1994235426","https://openalex.org/W2009803313","https://openalex.org/W2017927472","https://openalex.org/W2034441788","https://openalex.org/W2051283794","https://openalex.org/W2058748455","https://openalex.org/W2115049345","https://openalex.org/W2169528473","https://openalex.org/W2752853835","https://openalex.org/W2800875754","https://openalex.org/W3139863117","https://openalex.org/W4247549312","https://openalex.org/W4250871362","https://openalex.org/W4285719527","https://openalex.org/W6810978941"],"related_works":["https://openalex.org/W1996532959","https://openalex.org/W2481977957","https://openalex.org/W3191415409","https://openalex.org/W2091962886","https://openalex.org/W6922835526","https://openalex.org/W3161781519","https://openalex.org/W7222967106","https://openalex.org/W7099483021","https://openalex.org/W1966658892","https://openalex.org/W70027040"],"abstract_inverted_index":{"A":[0],"ubiquitous":[1],"problem":[2,71,176,329],"in":[3,19,89,106,151,157,218,248,258,288,326,349,362,375],"mathematical":[4],"programming":[5],"is":[6,56,72,118,147,164,177,180,187,226,243,272,316,331],"the":[7,111,160,171,174,195,200,214,219,234,244,249,265,275,285,306,322,324,328,333,341,364],"calculation":[8],"of":[9,78,108,144,154,167,197,202,213,216,223,236,246,267,309,313,319,321,343,359,370],"minimum":[10,28,38,85,120],"spanning":[11,14,76,121],"trees.":[12],"Minimum":[13],"tree":[15,113],"algorithms":[16,45,366],"find":[17,74],"application":[18],"such":[20],"diverse":[21],"areas":[22],"as:":[23],"least":[24],"cost":[25,29],"electrical":[26],"wiring,":[27],"connecting":[30],"communication":[31],"and":[32,42,51,126,179,296,338],"transportation":[33],"networks,":[34,40],"network":[35,53,82,161,208],"reliability":[36],"problems,":[37,50],"stress":[39],"clustering":[41],"numerical":[43],"taxonomy,":[44],"for":[46,170,252,305,367],"solving":[47],"traveling":[48],"salesman":[49],"multiterminal":[52],"flows.":[54],"It":[55],"therefore":[57],"important":[58,368],"to":[59,62,73,133,173,189,206,228,293,347],"know":[60],"how":[61],"carry":[63],"out":[64],"these":[65,360],"computations":[66],"as":[67,69,351,353],"efficiently":[68],"possible.The":[70],"a":[75,79,93,119,141,152,207,255,317],"subtree":[77],"given":[80],"connected":[81],"which":[83,131,301,327],"has":[84],"total":[86],"length.":[87],"Kruskal":[88,286],"1956":[90],"showed":[91],"that":[92,99,114,140,277],"\"greedy\"":[94],"algorithm":[95,130,315],"could":[96],"be":[97,116,134,262,373],"used;":[98],"is,":[100],"if":[101],"one":[102,345],"looks":[103],"at":[104],"arcs":[105,217,247],"order":[107,201,235],"increasing":[109],"length":[110],"first":[112],"can":[115,261],"formed":[117],"tree.":[122],"Shortly":[123],"thereafter":[124],"Prim":[125],"Dijkstra":[127],"suggested":[128],"another":[129],"appeared":[132],"more":[135,149],"efficient.":[136],"Recent":[137],"work":[138],"suggests":[139],"suitable":[142],"implementation":[143],"Kruskal's":[145,168,224,268,297],"Algorithm":[146,169,186,225,279],"computationally":[148],"efficient":[150],"number":[153,196,215,245],"interesting":[155],"cases,":[156],"particular":[158],"when":[159,204],"under":[162],"consideration":[163],"sparse.A":[165],"modification":[166,222],"solution":[172],"MST":[175],"presented":[178],"compared":[181],"with":[182,209],"Prim's":[183,185,278,295],"Algorithm.":[184,269],"shown":[188,227],"have":[190,229],"an":[191,230],"upper":[192,231,282],"bound":[193,232,283],"on":[194,199,233],"calculations":[198],"NN2,":[203],"applied":[205],"NN":[210],"nodes,":[211],"regardless":[212],"network.":[220,250],"The":[221,270,357],"NA":[237,239,242],"log2":[238],"calculations,":[240],"where":[241],"Thus":[251],"sparse":[253],"networks":[254],"dramatic":[256],"reduction":[257],"execution":[259],"time":[260,344],"obtained":[263],"by":[264,274],"use":[266],"effect":[271],"enhanced":[273],"fact":[276],"achieves":[280],"its":[281],"while":[284],"modification,":[287],"general,":[289],"does":[290],"not.":[291],"Modifications":[292],"both":[294],"Algorithms":[298],"are":[299],"introduced":[300],"give":[302],"significant":[303],"improvements":[304],"complete":[307],"range":[308],"sparseness.The":[310],"relative":[311],"merit":[312],"each":[314],"function":[318],"sparseness":[320],"network,":[323],"form":[325],"data":[330],"represented,":[332],"tradeoff":[334],"between":[335],"computation":[336],"speed":[337],"storage":[339],"requirements,":[340],"amount":[342],"wants":[346],"spend":[348],"coding,":[350],"well":[352],"many":[354],"other":[355],"factors.":[356],"interaction":[358],"factors":[361],"choosing":[363],"appropriate":[365],"classes":[369],"applications":[371],"will":[372],"discussed":[374],"detail.":[376]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}