HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Efficient Union-Find for Planar Graphs and other Sparse Graph Classes

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00549672
Contributor : Jens Gustedt Connect in order to contact the contributor
Submitted on : Wednesday, December 22, 2010 - 12:08:12 PM
Last modification on : Monday, December 28, 2020 - 10:22:04 AM

Identifiers

  • HAL Id : inria-00549672, version 1

Citation

Jens Gustedt. Efficient Union-Find for Planar Graphs and other Sparse Graph Classes. Graph-Theoretic Concepts in Computer Science, 1996, Cadenabbia, Italy. pp.181-195. ⟨inria-00549672⟩

Share

Metrics

Record views

24