{"id":"https://openalex.org/W2041080724","doi":"https://doi.org/10.1145/1795396.1795459","title":"A fast minimal storage computational algorithm for determining a minimal spanning tree in a graph","display_name":"A fast minimal storage computational algorithm for determining a minimal spanning tree in a graph","publication_year":1977,"publication_date":"1977-01-01","ids":{"openalex":"https://openalex.org/W2041080724","doi":"https://doi.org/10.1145/1795396.1795459","mag":"2041080724"},"language":"en","primary_location":{"id":"doi:10.1145/1795396.1795459","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1795396.1795459","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th annual Southeast regional conference on - ACM-SE 15","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5012300340","display_name":"Pentti A. Honkanen","orcid":null},"institutions":[{"id":"https://openalex.org/I181565077","display_name":"Georgia State University","ror":"https://ror.org/03qt6ba18","country_code":"US","type":"education","lineage":["https://openalex.org/I181565077"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Pentti A. Honkanen","raw_affiliation_strings":["[Georgia State University, Atlanta, Georgia]"],"affiliations":[{"raw_affiliation_string":"[Georgia State University, Atlanta, Georgia]","institution_ids":["https://openalex.org/I181565077"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012300340"],"corresponding_institution_ids":["https://openalex.org/I181565077"],"apc_list":null,"apc_paid":null,"fwci":0.6207,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.70731179,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"458","last_page":"458"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9850000143051147,"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/spanning-tree","display_name":"Spanning tree","score":0.9204641580581665},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7970764636993408},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.6357669830322266},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.6066811680793762},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.6031192541122437},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5967499017715454},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5508680939674377},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5348865389823914},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.5332709550857544},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5271912217140198},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4684450924396515},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.4224620461463928},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.4180571138858795},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41023680567741394},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3510320782661438},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3426014184951782},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.21737095713615417},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.10153743624687195}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.9204641580581665},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7970764636993408},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.6357669830322266},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.6066811680793762},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.6031192541122437},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5967499017715454},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5508680939674377},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5348865389823914},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.5332709550857544},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5271912217140198},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4684450924396515},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.4224620461463928},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4180571138858795},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41023680567741394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3510320782661438},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3426014184951782},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.21737095713615417},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.10153743624687195}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1795396.1795459","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1795396.1795459","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th annual Southeast regional conference on - ACM-SE 15","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land","score":0.6399999856948853}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2144599263","https://openalex.org/W2752853835"],"related_works":["https://openalex.org/W2390742649","https://openalex.org/W2943635264","https://openalex.org/W2387385213","https://openalex.org/W3016811403","https://openalex.org/W2589768050","https://openalex.org/W4380840098","https://openalex.org/W2281826919","https://openalex.org/W1593284275","https://openalex.org/W2138987445","https://openalex.org/W2014991506"],"abstract_inverted_index":{"When":[0],"a":[1,8,11,25,32,44,51,56,62,67],"system":[2],"or":[3,61,92,101],"process":[4],"is":[5,17,21,71,103,128],"represented":[6],"as":[7],"graph":[9,70],"and":[10,79,108],"unique":[12,33],"interconnection":[13],"between":[14,35],"the":[15,19,48,80,89,97,118,126],"quantities":[16],"desired":[18],"problem":[20],"one":[22],"of":[23,50,83,96],"selecting":[24],"spanning":[26,29,41,53,64,90,99],"tree.":[27],"Each":[28],"tree":[30,54],"gives":[31],"path":[34],"vertices,":[36],"but":[37],"there":[38],"are":[39,111,115],"many":[40],"trees":[42],"for":[43,47,55,66],"graph.An":[45],"algorithm":[46,74],"selection":[49],"minimal":[52,63],"given":[57],"weighted":[58,69],"connected":[59],"graph,":[60],"forest":[65,102],"disconnected":[68],"presented.":[72],"The":[73,94,121],"utilizes":[75],"sparse":[76],"matrix":[77],"techniques,":[78],"basic":[81],"concept":[82],"ring":[84],"sum":[85],"operations":[86],"to":[87],"obtain":[88],"tree,":[91,100],"forest.":[93],"minimality":[95],"resultant":[98],"proven.":[104],"In":[105],"addition,":[106],"timing":[107],"storage":[109],"requirements":[110],"determined.":[112],"Several":[113],"cases":[114],"studied":[116],"including":[117],"worst":[119],"case.":[120],"only":[122],"restriction":[123],"placed":[124],"on":[125],"graphs":[127],"that":[129],"they":[130],"do":[131],"not":[132],"have":[133],"any":[134],"isolated":[135],"vertices.":[136]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}