An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees

DOI10.1007/978-3-642-11409-0_16zbMath1273.68177OpenAlexW1491195793MaRDI QIDQ5851104

Torben Hagerup

Publication date: 21 January 2010

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11409-0_16

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Euclidean minimum spanning trees with independent and dependent geometric uncertainties ⋮ A new algorithm for the minimum spanning tree verification problem

This page was built for publication: An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees