Torben Hagerup. An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees. In Christophe Paul, Michel Habib, editors, Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers. Volume 5911 of Lecture Notes in Computer Science, pages 178-189, 2009. [doi]
@inproceedings{Hagerup09,
title = {An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees},
author = {Torben Hagerup},
year = {2009},
doi = {10.1007/978-3-642-11409-0_16},
url = {http://dx.doi.org/10.1007/978-3-642-11409-0_16},
researchr = {https://researchr.org/publication/Hagerup09},
cites = {0},
citedby = {0},
pages = {178-189},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
editor = {Christophe Paul and Michel Habib},
volume = {5911},
series = {Lecture Notes in Computer Science},
isbn = {978-3-642-11408-3},
}