Abstract
We present an optimal deterministic O(n)-work parallel algorithm for finding a minimum spanning tree on an n-vertex planar graph. The algorithm runs in O(log n) time on a CRCW PRAM and in O(log n log∗ n) time on an EREW PRAM. Our results hold for any sparse graph that is closed under taking of minors, as well as for a class of graphs with non-bounded genus.
Cite
CITATION STYLE
Chong, K. W., & Zaroliagis, C. (2015). An optimal parallel algorithm for minimum spanning trees in planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9295, pp. 169–182). Springer Verlag. https://doi.org/10.1007/978-3-319-24024-4_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
