{"id":"https://openalex.org/W2009938762","doi":"https://doi.org/10.1137/0210017","title":"An Algorithm for Finding <i>K</i> Minimum Spanning Trees","display_name":"An Algorithm for Finding <i>K</i> Minimum Spanning Trees","publication_year":1981,"publication_date":"1981-05-01","ids":{"openalex":"https://openalex.org/W2009938762","doi":"https://doi.org/10.1137/0210017","mag":"2009938762"},"language":"en","primary_location":{"id":"doi:10.1137/0210017","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210017","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5082448893","display_name":"Naoki Katoh","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"N. Katoh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113496426","display_name":"Toshihide Ibaraki","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"T. Ibaraki","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5113633254","display_name":"Hisashi Mine","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"H. Mine","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082448893"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.4824,"has_fulltext":false,"cited_by_count":87,"citation_normalized_percentile":{"value":0.92823878,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"10","issue":"2","first_page":"247","last_page":"255"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9969000220298767,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9969000220298767,"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/T11106","display_name":"Data Management and Algorithms","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9904999732971191,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8968249559402466},{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.8875218629837036},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8122129440307617},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7468110918998718},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6766983270645142},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.6651774048805237},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.6194937229156494},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4600922465324402},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.45101243257522583},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.4409765303134918},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4351566731929779},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4207687973976135},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.41162052750587463},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35869544744491577},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1428307592868805},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.14264336228370667},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.1397588551044464},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.13138160109519958}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8968249559402466},{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.8875218629837036},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8122129440307617},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7468110918998718},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6766983270645142},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.6651774048805237},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.6194937229156494},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4600922465324402},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.45101243257522583},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.4409765303134918},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4351566731929779},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4207687973976135},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.41162052750587463},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35869544744491577},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1428307592868805},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.14264336228370667},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.1397588551044464},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.13138160109519958},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0210017","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210017","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1965680834","https://openalex.org/W1973942323","https://openalex.org/W1984407615","https://openalex.org/W1986022261","https://openalex.org/W1996641400","https://openalex.org/W2017927472","https://openalex.org/W2023658462","https://openalex.org/W2091507391","https://openalex.org/W2128865241","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W4308416203","https://openalex.org/W3016811403","https://openalex.org/W2014991506","https://openalex.org/W1985149601","https://openalex.org/W2387385213","https://openalex.org/W88291963","https://openalex.org/W4380840098","https://openalex.org/W2091507391","https://openalex.org/W2401420742"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3,12],"algorithm":[4,48],"for":[5,106],"finding":[6],"K":[7],"minimum":[8,64,94,103],"spanning":[9,65,95,104],"trees":[10,105],"in":[11,67,97],"undirected":[13],"graph.":[14],"The":[15,47,54,88],"required":[16],"time":[17],"is":[18,29,35,42,49,76,84],"$O(Km":[19],"+":[20,31],"\\min":[21],"(n^2":[22,69],",m\\log":[23],"\\log":[24],"n))$":[25],"and":[26,40],"the":[27,36,43,62,92,101],"space":[28],"$O(K":[30],"m)$,":[32],"where":[33,73],"n":[34],"number":[37,44],"of":[38,45,79],"vertices":[39],"m":[41],"edges.":[46],"based":[50],"on":[51],"three":[52],"subroutines.":[53],"first":[55],"two":[56],"subroutines":[57],"are":[58,114],"used":[59],"to":[60],"obtain":[61],"second":[63],"tree":[66,96],"$O(\\min":[68],",m\\alpha":[70],"(m,n)))$":[71],"steps,":[72],"$\\alpha":[74],"(m,n)$":[75],"Tarjan\u2019s":[77],"inverse":[78],"Ackermann\u2019s":[80],"function":[81],"[12]":[82],"which":[83],"very":[85],"slowly":[86],"growing.":[87],"third":[89],"one":[90],"obtains":[91],"kth":[93],"$O(m)$":[98],"steps":[99],"when":[100],"jth":[102],"$j":[107],"=":[108],"1,2,":[109],"\\cdots":[110],",k":[111],"-":[112],"1$":[113],"given.":[115]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2025-10-10T00:00:00"}