Efficient Union-Find for Planar Graphs and other Sparse Graph Classes - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 1997

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

Résumé

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.
Fichier non déposé

Dates et versions

inria-00549672 , version 1 (22-12-2010)

Identifiants

  • HAL Id : inria-00549672 , version 1

Citer

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⟩
26 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More