{"id":"https://openalex.org/W1978099551","doi":"https://doi.org/10.1137/0221070","title":"Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time","display_name":"Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time","publication_year":1992,"publication_date":"1992-12-01","ids":{"openalex":"https://openalex.org/W1978099551","doi":"https://doi.org/10.1137/0221070","mag":"1978099551"},"language":"en","primary_location":{"id":"doi:10.1137/0221070","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0221070","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/A5012034192","display_name":"Brandon Dixon","orcid":"https://orcid.org/0000-0002-0504-2926"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Brandon Dixon","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035275121","display_name":"Monika Rauch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Monika Rauch","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012034192"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.3639,"has_fulltext":false,"cited_by_count":146,"citation_normalized_percentile":{"value":0.9207696,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"21","issue":"6","first_page":"1184","last_page":"1192"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9939000010490417,"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/T10142","display_name":"Formal Methods in Verification","score":0.9939000010490417,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9908999800682068,"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.9882000088691711,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8370485305786133},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7910785675048828},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.6748189926147461},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.6681760549545288},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.6293947100639343},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.6263208389282227},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5594637393951416},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5461429953575134},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.4858826994895935},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.4714330732822418},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4680326282978058},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4270819127559662},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4160478413105011},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3737811744213104},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27361685037612915},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0885215699672699}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8370485305786133},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7910785675048828},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.6748189926147461},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.6681760549545288},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.6293947100639343},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.6263208389282227},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5594637393951416},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5461429953575134},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.4858826994895935},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4714330732822418},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4680326282978058},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4270819127559662},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4160478413105011},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3737811744213104},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27361685037612915},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0885215699672699}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0221070","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0221070","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.49.25","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.25","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.digital.com/SRC/personal/monika/papers/monika-sicomp92.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1612751597","https://openalex.org/W1982512167","https://openalex.org/W2006918089","https://openalex.org/W2008441811","https://openalex.org/W2011999472","https://openalex.org/W2023658462","https://openalex.org/W2028341270","https://openalex.org/W2028503265","https://openalex.org/W2046946959","https://openalex.org/W2048500523","https://openalex.org/W2054329164","https://openalex.org/W2063688224","https://openalex.org/W2078199146","https://openalex.org/W2087216833","https://openalex.org/W2152506249","https://openalex.org/W2164485560"],"related_works":["https://openalex.org/W2381121915","https://openalex.org/W4380840098","https://openalex.org/W2387385213","https://openalex.org/W2899787781","https://openalex.org/W2390742649","https://openalex.org/W2589768050","https://openalex.org/W3016811403","https://openalex.org/W3010298256","https://openalex.org/W3101457564","https://openalex.org/W2353025557"],"abstract_inverted_index":{"Koml\u00f3s":[0,63],"has":[1],"devised":[2],"a":[3,7,16,21,27,48,53,65,76,87],"way":[4],"to":[5,13],"use":[6],"linear":[8],"number":[9],"of":[10,20,62,94],"binary":[11],"comparisons":[12],"test":[14],"whether":[15],"given":[17],"spanning":[18,29,55,96],"tree":[19],"graph":[22],"with":[23,64,75],"edge":[24],"costs":[25],"is":[26,39],"minimum":[28,54,95],"tree.":[30,56],"The":[31],"total":[32],"computational":[33],"work":[34],"required":[35],"by":[36],"his":[37],"method":[38,70],"much":[40],"larger":[41],"than":[42],"linear,":[43],"however.":[44],"This":[45,57],"paper":[46],"describes":[47],"linear-time":[49,88],"algorithm":[50,58,85,90],"for":[51,71,91],"verifying":[52],"combines":[59],"the":[60],"result":[61],"preprocessing":[66],"and":[67,74,86],"table":[68],"look-up":[69],"small":[72],"subproblems":[73],"previously":[77],"known":[78],"almost-linear-time":[79],"algorithm.":[80],"Additionally,":[81],"an":[82],"optimal":[83],"deterministic":[84],"randomized":[89],"sensitivity":[92],"analysis":[93],"trees":[97],"are":[98],"presented.":[99]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}