Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses

We consider the problem of coding planar graphs by binary strings. Depending on whether O(1)-time queries for adjacency and degree are supported, we present three sets of coding schemes which all take linear time for encoding and decoding. The encoding lengths are significantly shorter than the previously known results in each case.

[1]  György Turán,et al.  On the succinct representation of graphs , 1984, Discret. Appl. Math..

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

[3]  Peter Elias,et al.  Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.

[4]  Moni Naor,et al.  Implicit representation of graphs , 1992, STOC '88.

[5]  Guy Jacobson,et al.  Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[6]  V. Vinay,et al.  Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science , 1996 .

[7]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[8]  Avi Wigderson,et al.  Succinct Representations of Graphs , 1984, Inf. Control..

[9]  Xin He,et al.  Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs , 1994, SIAM J. Discret. Math..

[10]  Goos Kant,et al.  Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems , 1997, Theor. Comput. Sci..

[11]  Xin He,et al.  Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings , 1999, SIAM J. Discret. Math..

[12]  Goos Kant,et al.  Drawing planar graphs using the lmc-ordering , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[13]  Ming-Yang Kao,et al.  Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs , 1994, ISAAC.

[14]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[15]  Ming-Yang Kao,et al.  Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs , 1998, J. Comb. Optim..

[16]  David Richard Clark,et al.  Compact pat trees , 1998 .

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

[18]  Goos Kant.  Drawing Planar Graphs Using the lmc-Ordering (Extended Abstract) , 1992, FOCS 1992.

[19]  Jeffery R. Westbrook,et al.  Short Encodings of Planar Graphs and Maps , 1995, Discret. Appl. Math..

[20]  W. T. Tutte,et al.  A Census of Planar Triangulations , 1962, Canadian Journal of Mathematics.

[21]  Mihalis Yannakakis,et al.  A Note on Succinct Representations of Graphs , 1986, Inf. Control..

[22]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[23]  Venkatesh Raman,et al.  Succinct representation of balanced parentheses, static trees and planar graphs , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[24]  G. Kant.  Algorithms for drawing planar graphs , 1993 .