Efficient Union-Find for planar graphs and other sparse graph classes
We solve the Union-Find problem (UF) efficiently for the case the input is restricted to several graph classes, namely partial k-trees for any fixed k, d-dimensional grids for any fixed dimension d and for planar graphs. For the later we develop a technique of decomposing such a graph into small subgraphs, patching, that might be useful for other algorithmic problems on planar graphs, too.
By efficiency we do not only mean “linear time” in a theoretical setting but also a practical reorganization of memory such that a dynamic data structures for UF is allocated consecutively and thus to reduce the amount of page fault produced by UF implementations drastically.
Unable to display preview. Download preview PDF.
- 1.Harold N. Gabow and Robert E. Tarjan. A linear-time algorithm for a special case of disjoint set union. J. Comput. System Sci., 30:209–221, 1984.Google Scholar
- 2.Robert E. Tarjan. A class of algorithms which require non-linear time to maintain disjoint sets. J. Comput. System Sci., 18:110–127, 1979.Google Scholar
- 3.J. A. La Poutré. Lower bounds for the union-find and the split-find problem on pointer machines (extended abstract). 1990.Google Scholar
- 4.Michael B. Dillencourt, Hanan Samet, and Markku Tamminen. A general approach to connected-component labeling for arbitrary image representations. J. Assoc. Comput. Mach., 39(2):253–280, April 1992. Corr. p. 985–986.Google Scholar
- 5.Christophe Fiorio and Jens Gustedt. Two linear time Union-Find strategies for mage processing. Theoret. Comput. Sci., 154(2):165–181, February 1996.Google Scholar
- 6.Robert E. Tarjan. Efficiency of a good but not linear set union algorithm. J. Assoc. Comput. Mach., 22:215–225, 1975.Google Scholar
- 7.Hans L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. in , 1993.Google Scholar
- 8.Richard J. Lipton and Robert Endre Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36:177–189, 1979.Google Scholar
- 9.In Proceedings of the Twenty Fifth Anual ACM Symposion on Theory of Computing. ACM, Assoc. for Comp. Machinery, 1993.Google Scholar