Dynamic Representations of Sparse Graphs
We present a linear space data structure for maintaining graphs with bounded arboricity—a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth—under edge insertions, edge deletions, and adjacency queries.
The data structure supports adjacency queries in worst case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity.
KeywordsPlanar Graph Implicit Representation Outgoing Edge Sparse Graph Adjacency List
Unable to display preview. Download preview PDF.
- 3.Chuang, Garg, He, Kao, and Lu. Compact encodings of planar graphs via canonical orderings and multiple parentheses. In ICALP: Annual International Colloquium on Automata, Languages and Programming, 1998.Google Scholar
- 9.Peter Bro Miltersen. Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 556–563, 1998.Google Scholar
- 10.J. Ian Munro and Venkatesh Raman. Succinct representation of balanced parentheses, static trees and planar graphs. In 38th Annual Symposium on Foundations of Computer Science, pages 118–126, 20-22 October 1997.Google Scholar
- 16.Jan van Leeuwen. Graph algorithms. In Handbook of Theoretical Computer Science, vol. A: Algorithms and Complexity, pages 525–631. North-Holland Publ. Comp., Amsterdam, 1990.Google Scholar