A Structural Approach to Graph Compression

We consider graph compression in terms of graph families. In particular, we show that graphs of bounded genus can be compressed to O(n) bits, where n is the number of vertices. We identify a property based on separators that makes O(n)-bit compression possible for some graphs of bounded arboricity.

[1]  Mihalis Yannakakis,et al.  Four pages are necessary and sufficient for planar graphs , 1986, Symposium on the Theory of Computing.

[2]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[3]  Kyungsook Yoon Lee.  Interconnection networks and compiler algorithms for multiprocessors , 1983 .

[4]  Michael R. Fellows,et al.  On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design , 1989, SIAM J. Discret. Math..

[5]  Narsingh Deo,et al.  PASCAL GRAPHS AND THEIR PROPERTIES , 1983 .

[6]  Carsten Thomassen,et al.  The Graph Genus Problem is NP-Complete , 1989, J. Algorithms.

[7]  J. Hammersley,et al.  Graphs, Groups and Surfaces. , 1975 .

[8]  Robin Thomas,et al.  A separator theorem for graphs with an excluded minor and its applications , 1990, STOC '90.

[9]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[10]  Alon Itai,et al.  Representation of graphs , 1982, Acta Informatica.

[11]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[12]  Moni Naor.  Succinct representation of general unlabeled graphs , 1990, Discret. Appl. Math..

[13]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[14]  John R Gilbert,et al.  A Separator Theorem for Graphs of Bounded Genus , 1984, J. Algorithms.

[15]  Lenwood S. Heath,et al.  The pagenumber of genus g graphs is O(g) , 1992, JACM.