Succinct Representations of Separable Graphs
We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In particular, we show constant-time support for adjacency, degree and neighborhood queries. For any monotone class of separable graphs, the storage requirement of the representation is optimal to within lower order terms.
Separable graphs are those that admit a O(n c )-separator theorem where c < 1. Many graphs that arise in practice are indeed separable. For instance, graphs with a bounded genus are separable. In particular, planar graphs (genus 0) are separable and our scheme gives the first succinct representation of planar graphs with a storage requirement that matches the information-theory minimum to within lower order terms with constant time support for the queries.
We, furthers, show that we can also modify the scheme to succinctly represent the combinatorial planar embedding of planar graphs (and hence encode planar maps).
KeywordsPlanar Graph Storage Requirement Lower Order Term Graph Label Neighborhood Query
Unable to display preview. Download preview PDF.
- 10.Leighton, T., Rao, S.: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In: FOCS 1988: Foundations of Computer Science, pp. 422–431. IEEE, Los Alamitos (1988)Google Scholar
- 11.Blandford, D.K., Blelloch, G.E., Kash, I.A.: Compact representations of separable graphs. In: SODA: ACM-SIAM Symposium on Discrete Algorithms (2003)Google Scholar
- 14.Lu, H.I.: Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits. In: SODA 2002: Proceedings of ACM-SIAM symposium on Discrete algorithms, pp. 223–224 (2002)Google Scholar
- 17.Keeler, W.: Short encodings of planar graphs and maps. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 58 (1995)Google Scholar
- 19.Jacobson, G.: Space-efficient static trees and graphs. In: 30th Annual Symposium on Foundations of Computer Science, 1989, October 30 – November 1, pp. 549–554 (1989)Google Scholar
- 20.Munro, J.I., Raman, V.: Succinct representation of balanced parentheses, static trees and planar graphs. In: IEEE Symposium on Foundations of Computer Science, pp. 118–126 (1997)Google Scholar
- 22.Chiang, Y.T., Lin, C.C., Lu, H.I.: Orderly spanning trees with applications to graph encoding and graph drawing. In: SODA 2001: ACM-SIAM symposium on Discrete algorithms, pp. 506–515 (2001)Google Scholar