Linear-time succinct encodings of planar graphs via canonical orderings

SIAM Journal on Discrete Mathematics

Volumn 12, Issue 3, 1999, Pages 317-325

  He, Xin ^a   Kao, Ming Yang ^b   Lu, Hsueh I ^c  

^a the State University of New York   (United States)

^b Yale University   (United States)

^c NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

Canonical ordering; Data compression; Graph encoding; Planar graphs; Triangulations; Triconnected graphs

Indexed keywords

EID: 0001740837     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480197325031     Document Type: Article

References (23)

1. T. C. BELL, J. G. CLEARY, AND I. H WITTEN, Text Compression, Prentice-Hall, Englewood Cliffs, NJ, 1990.
2. C. BERGE, Graphs, 2nd ed., North-Holland, New York, NY, 1985.
3. T. H. CORMEN, C. L. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990
4. H DE FRAYSSEIX, J. PACH, AND R. POLLACK, How to draw a planar graph on a grid, Combinatorica, 10 (1990), pp. 41-51
5. P. ELIAS, Universal codeword sets and representations of the integers, IEEE Trans. Inform. Theory, IT-21 (1975), pp. 194-203.
6. H. GALPERIN AND A. WIGDERSON, Succinct representations of graphs, Inform. and Control, 56 (1983), pp. 183-198.
7. F. HARARY, Graph Theory, Addison-Wesley, Reading, MA, 1972.
8. A. ITAI AND M. RODEH, Representation of graphs, Acta Inform., 17 (1982), pp. 215-219.
9. G. JACOBSON, Space-efficient static trees and graphs, in Proceedings of the 13th Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Press, Washington, DC, 1989, pp. 549-554.
10. S. KANNAN, M. NAOR, AND S. RUDICH, Implicit representation of graphs, SIAM J. Discrete Math., 5 (1992), pp. 596-603.
11. G. KANT, Drawing planar graphs using the lmc-ordering, in Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Press, Washington, DC, 1992, pp. 101-110.
12. G. KANT AND X. HE, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoret. Comput. Sci , 172 (1997), pp. 175-193.
13. M. Y KAO, M. FÜRER, X. HE, AND B. RAGHAVACHARI, Optimal parallel algorithms for straight-line grid embeddings of planar graphs, SIAM J. Discrete Math., 7 (1994), pp. 632-646.
14. M. Y. KAO, N. OCCHIOGROSSO, AND S. H. TENG, Simple and efficient compression schemes for dense and complement graphs, J. Combin. Optim., (1999), to appear.
15. K KEELER AND J. WESTBROOK, Short encodings of planar graphs and maps, Discrete Appl. Math., 58 (1995), pp. 239-252.
16. L. Lovász, An Algorithmic Theory of Numbers, Graphs and Convexity, CBMS-NSF Regional Conference Series in Appl. Math 50, SIAM, Philadelphia, PA, 1986.
17. J I. MUNRO AND V RAMAN, Succinct representation of balanced parentheses, static trees and planar graphs, in Proceedings of the 38th Annual IEEE Symposium on the Foundations of Computer Science (FOCS), IEEE Press, Washington, DC, 1997, pp. 118-126.
18. M. NAOR, Succinct representations of general unlabeled graphs, Discrete Appl. Math., 28 (1990), pp. 303-307.
19. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, A note on succinct representations of graphs, Inform. and Control, 71 (1986), pp. 181-185.
20. W. SCHNYDER, Embedding planar graphs on the grid, in Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, 1990, pp. 138-148.
21. G. TURÁN, On the succinct representation of graphs, Discrete Appl. Math., 8 (1984), pp. 289-294.
22. W. T. TUTTE, A census of planar triangulations, Canad. J. Math., 14 (1962), pp. 21-38.
23. W T. TUTTE, A census of planar maps, Canad. J. Math., 15 (1963), pp. 249-271