{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T09:24:53Z","timestamp":1759742693579},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1007\/bf02523235","type":"journal-article","created":{"date-parts":[[2006,11,7]],"date-time":"2006-11-07T23:39:46Z","timestamp":1162942786000},"page":"11-18","source":"Crossref","is-referenced-by-count":11,"title":["Optimal parallel verification of minimum spanning trees in logarithmic time"],"prefix":"10.1007","volume":"17","author":[{"given":"B.","family":"Dixon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. E.","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02523235_CR1","unstructured":"N. Alon and B. Schieber, Optimal Preprocessing for Answering On-Line Product Queries, Unpublished manuscript."},{"issue":"10","key":"BF02523235_CR2","doi-asserted-by":"crossref","first-page":"1258","DOI":"10.1109\/TC.1987.1676869","volume":"36","author":"B. Awerbuch","year":"1987","unstructured":"B. Awerbuch and Y. Shiloach, New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM,IEEE Trans. Comput. 36(10) (1987), 1258\u20131263.","journal-title":"IEEE Trans. Comput."},{"key":"BF02523235_CR3","unstructured":"H. Booth and J. Westbrook, Linear Algorithms for Analysis of Minimum Spanning and Shortest Path Trees in Planar Graphs, TR-768, Department of Computer Science, Yale University, Feb. 1990."},{"key":"BF02523235_CR4","unstructured":"R. Cole, P. Klein, and R. E. Tarjan, A Linear-work Parallel Algorithm for Finding Minimum Spanning Trees,Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, 1994."},{"issue":"6","key":"BF02523235_CR5","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1137\/0221070","volume":"21","author":"B. Dixon","year":"1992","unstructured":"B. Dixon, M. Rauch, and R. E. Tarjan, Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time,SIAM J. Comput. 21(6) (1992), 1184\u20131192.","journal-title":"SIAM J. Comput."},{"issue":"2","key":"BF02523235_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","volume":"6","author":"H. N. Gabow","year":"1986","unstructured":"H. N. Gabow, Z. Galil, T. Spencer, and R. E. Tarjan, Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs,Combinatorica 6(2) (1986), 109\u2013122.","journal-title":"Combinatorica"},{"issue":"2","key":"BF02523235_CR7","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel and R. E. Tarjan, Fast Algorithms for Finding Nearest Common Ancestors,SIAM J. Comput. 13(2) (1984), 338\u2013355.","journal-title":"SIAM J. Comput."},{"key":"BF02523235_CR8","doi-asserted-by":"crossref","unstructured":"D. B. Johnson and P. Metaxas, A Parallel Algorithm for Computing Minimum Spanning Trees,Proc. 4th ACM Symp. on Parallel Algorithms and Architectures, 1992, pp. 363\u2013372.","DOI":"10.1145\/140901.141917"},{"key":"BF02523235_CR9","series-title":"Handbook of Theoretical Computer Science","volume-title":"Parallel Algorithms for Shared Memory Machines","author":"R. Karp","year":"1990","unstructured":"R. Karp and V. Ramachandran, Parallel Algorithms for Shared Memory Machines,Handbook of Theoretical Computer Science, Elsevier. Amsterdam, 1990, Chapter 17."},{"key":"BF02523235_CR10","doi-asserted-by":"crossref","unstructured":"V. King, A Simpler Minimum Spanning Tree Verification Algorithm, Manuscript, 1994.","DOI":"10.1007\/3-540-60220-8_83"},{"key":"BF02523235_CR11","doi-asserted-by":"crossref","unstructured":"P. Klein and R. E. Tarjan, A Randomized Linear Time Algorithm for Finding Minimum Spanning Trees,Proc. 26th Annual ACM Symp. on Theory of Computing, 1994.","DOI":"10.1145\/195058.195084"},{"key":"BF02523235_CR12","doi-asserted-by":"crossref","unstructured":"J. H. Reif, An Optimal Parallel Algorithm for Integer Sorting,Proc. 26th Annual ACM Symp. on Foundations of Computer Science, 1985, pp. 496\u2013504.","DOI":"10.1109\/SFCS.1985.9"},{"issue":"4","key":"BF02523235_CR13","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1145\/322154.322161","volume":"26","author":"R. E. Tarjan","year":"1979","unstructured":"R. E. Tarjan, Applications of Path Compressions on Balanced Trees,J. Assoc. Comput. Mach. 26(4) (1979), 690\u2013715.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"BF02523235_CR14","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/0020-0190(82)90137-5","volume":"14","author":"R. E. Tarjan","year":"1982","unstructured":"R. E. Tarjan, Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees,Inform. Process. Lett. 14(1) (1982), 30\u201333. Corrigendum, ibid. Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees,Inform. Process. Lett. 23 (1986), 219.","journal-title":"Inform. Process. Lett."},{"key":"BF02523235_CR15","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R. E. Tarjan","year":"1983","unstructured":"R. E. Tarjan,Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02523235.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02523235\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02523235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:39:41Z","timestamp":1558283981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02523235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["BF02523235"],"URL":"https:\/\/doi.org\/10.1007\/bf02523235","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}