{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T00:55:14Z","timestamp":1791161714325,"version":"4.1.0"},"reference-count":20,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1992,12]]},"abstract":"<jats:p>Koml\u00f3s has devised a way to use a linear number of binary comparisons to test whether a given spanning tree of a graph with edge costs is a minimum spanning tree. The total computational work required by his method is much larger than linear, however. This paper describes a linear-time algorithm for verifying a minimum spanning tree. This algorithm combines the result of Koml\u00f3s with a preprocessing and table look-up method for small subproblems and with a previously known almost-linear-time algorithm. Additionally, an optimal deterministic algorithm and a linear-time randomized algorithm for sensitivity analysis of minimum spanning trees are presented.<\/jats:p>","DOI":"10.1137\/0221070","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:38:23Z","timestamp":1109227103000},"page":"1184-1192","source":"Crossref","is-referenced-by-count":99,"title":["Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time"],"prefix":"10.1137","volume":"21","author":[{"given":"Brandon","family":"Dixon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Monika","family":"Rauch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(86)90029-2"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01187017"},{"key":"R3","unstructured":"B. Chazelle,  Efficient polygon triangulation, CS-TR-249-90, Princeton Univ., Princeton, NJ,  1990, Feb."},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89541"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89541"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1137\/0205006"},{"key":"R6","unstructured":"M. L. Fredman, D. E. Willard,  Trans-dichotomous algorithms for minimum spanning trees and shortest paths,  Proc. 31st Annual IEEE Symposium on Foundations in Comput. Sci., Vol. 2, IEEE Computer Society Press, Los Alamitos, CA,  1990,  719\u2013725"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579168"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90014-5"},{"key":"R9","unstructured":"W. Goddard, V. King, L. Schulman,  Optimal randomized algorithms for local sorting and set-maxima,  Proc. 22nd Annual ACM Symposium on Theory of Computing, ACM Press, New York,  1990,  45\u201353"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1109\/MAHC.1985.10011"},{"key":"R11","unstructured":"D. Harel,  A linear time algorithm for finding dominators in flow graphs and related problems,  Proc. 17th Annual ACM Symposium on Theory of Computing, Salem, MA,  1985,  185\u2013194"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/0213024"},{"key":"R13","unstructured":"V. King, personal communication"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579443"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90084-B"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1137\/0217079"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322161"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90137-5"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0221070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:50:36Z","timestamp":1787338236000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0221070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["10.1137\/0221070"],"URL":"https:\/\/doi.org\/10.1137\/0221070","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}