{"id":"https://openalex.org/W2091507391","doi":"https://doi.org/10.1137/0206011","title":"Two Algorithms for Generating Weighted Spanning Trees in Order","display_name":"Two Algorithms for Generating Weighted Spanning Trees in Order","publication_year":1977,"publication_date":"1977-03-01","ids":{"openalex":"https://openalex.org/W2091507391","doi":"https://doi.org/10.1137/0206011","mag":"2091507391"},"language":"en","primary_location":{"id":"doi:10.1137/0206011","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206011","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/A5001013961","display_name":"Harold N. Gabow","orcid":"https://orcid.org/0000-0002-9775-3492"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Harold N. Gabow","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001013961"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2157,"has_fulltext":false,"cited_by_count":156,"citation_normalized_percentile":{"value":0.92762083,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"6","issue":"1","first_page":"139","last_page":"150"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.991599977016449,"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.991599977016449,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9914000034332275,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/ackermann-function","display_name":"Ackermann function","score":0.9366553425788879},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8948705196380615},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.758380115032196},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6680009961128235},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6641217470169067},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5567876696586609},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.553736686706543},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.5509171485900879},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4777740240097046},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4658452272415161},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.43592146039009094},{"id":"https://openalex.org/keywords/weight-function","display_name":"Weight function","score":0.4240975081920624},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.41049039363861084},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.401278555393219}],"concepts":[{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.9366553425788879},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8948705196380615},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.758380115032196},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6680009961128235},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6641217470169067},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5567876696586609},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.553736686706543},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.5509171485900879},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4777740240097046},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4658452272415161},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.43592146039009094},{"id":"https://openalex.org/C134466208","wikidata":"https://www.wikidata.org/wiki/Q1520657","display_name":"Weight function","level":2,"score":0.4240975081920624},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.41049039363861084},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.401278555393219},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","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/0206011","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206011","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1973942323","https://openalex.org/W1984407615","https://openalex.org/W1986022261","https://openalex.org/W2057084070","https://openalex.org/W2118966355","https://openalex.org/W2128865241","https://openalex.org/W2136620308","https://openalex.org/W2151285717","https://openalex.org/W2767970464"],"related_works":["https://openalex.org/W2014991506","https://openalex.org/W4308416203","https://openalex.org/W2943635264","https://openalex.org/W2307044859","https://openalex.org/W2387385213","https://openalex.org/W1898478360","https://openalex.org/W4220861011","https://openalex.org/W2099915933","https://openalex.org/W4380840098","https://openalex.org/W2091507391"],"abstract_inverted_index":{"Two":[0],"algorithms":[1],"for":[2],"generating":[3],"spanning":[4,85,108,121],"trees":[5,109],"of":[6,12,35,59,65,72,103,110,120],"a":[7,82,88,101],"connected":[8],"graph":[9],"in":[10,30,113],"order":[11],"increasing":[13],"weight":[14,23,84],"are":[15],"presented.":[16],"The":[17,38,79,98],"first":[18],"generates":[19,106],"the":[20,36,48,57,63,104,111,118,123,128],"K":[21,26],"smallest":[22],"trees,":[24,122],"where":[25],"can":[27],"be":[28],"specified":[29],"advance":[31],"or":[32],"during":[33],"execution":[34],"algorithm.":[37],"run":[39],"time":[40,124],"is":[41,50,56,62,69,76,117,125,130],"$O(KE\\alpha":[42],"(E,V)":[43],"+":[44,52],"E\\log":[45],"E)$":[46],"and":[47,67,75,91,127],"space":[49,129],"$O(K":[51],"E)$;":[53],"here":[54],"V":[55],"number":[58,64,119],"vertices,":[60],"E":[61],"edges,":[66],"$\\alpha$":[68],"Tarjan\u2019s":[70],"inverse":[71],"Ackermann\u2019s":[73],"function":[74],"very":[77],"slow-growing.":[78],"algorithm":[80],"uses":[81],"minimum":[83],"tree":[86],"as":[87],"\u201creference":[89],"tree\u201d,":[90],"exchanges":[92],"edges":[93],"to":[94],"derive":[95],"other":[96],"trees.":[97],"second":[99],"algorithm,":[100],"modification":[102],"first,":[105],"all":[107],"graph,":[112],"order.":[114],"If":[115],"N":[116],"$O(NE)$":[126],"$O(N+E)$.":[131]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":7}],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2025-10-10T00:00:00"}