A fast general methodology for information-theoretically optimal encodings of graphs

SIAM Journal on Computing

Volumn 30, Issue 3, 2000, Pages 838-846

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

^a UNIVERSITY AT BUFFALO   (United States)

^b Yale University   (United States)

^c INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

Biconnected graphs; Cycle separators; Data compression; Graph encoding; Planar graphs; Triangulations; Triconnected graphs

Indexed keywords

BINARY SEQUENCES; DATA COMPRESSION; INFORMATION THEORY; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

PLANAR GRAPHS;

GRAPH THEORY;

EID: 0034941107     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799359117     Document Type: Article

References (18)

1. T. C. BELL, J. G. CLEARY, AND I. H. WITTEN, Text Compression, Prentice-Hall, Englewood Cliffs, NJ, 1990.
2. R. C.-N. CHUANG, A. GARG, X. HE, M.-Y. KAO, AND H.-I LU, Compact encodings of planar graphs via canonical orderings and multiple parentheses, in Automata, Languages and Programming, 25th Colloquium, K. G. Larsen, S. Skyum, and G. Winskel, eds., Lecture Notes in Comput. Sci. 1443, Springer-Verlag, Aalborg, Denmark, 1998, pp. 118-129.
3. P. ELIAS, Universal codeword sets and representations of the integers, IEEE Trans. Inform. Theory, IT-21 (1975), pp. 194-203.
4. H. GALPERIN AND A. WIGDERSON, Succinct representations of graphs, Inform. and Control, 56 (1983), pp. 183-198.
5. X. HE, M.-Y. KAO, AND H.-I LU, Linear-time succinct encodings of planar graphs via canonical orderings, SIAM J. Discrete Math., 12 (1999), pp. 317-325.
6. A. ITAI AND M. RODEH, Representation of graphs, Acta Inform., 17 (1982), pp. 215-219.
7. G. JACOBSON, Space-efficient static trees and graphs, in Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, NC, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 549-554.
8. S. KANNAN, M. NAOR, AND S. RUDICH, Implicit representation of graphs, SIAM J. Discrete Math., 5 (1992), pp. 596-603.
9. M. Y. KAO, N. OCCHIOGROSSO, AND S. H. TENG, Simple and efficient compression schemes for dense and complement graphs, J. Combin. Optim., 2 (1999), pp. 351-359.
10. K. KEELER AND J. WESTBROOK, Short encodings of planar graphs and maps, Discrete Appl. Math., 58 (1995), pp. 239-252.
11. R. J. LIPTON AND R. E. TARJAN, A separator theorem for planar graphs, SIAM J. Appl. Math., 36 (1979), pp. 177-189.
12. G. L. MILLER, Finding small simple cycle separators for 2-connected planar graphs, J. Comput. System Sci., 32 (1986), pp. 265-279.
13. J. I. MUNRO AND V. RAMAN, Succinct representation of balanced parentheses, static trees and planar graphs, in Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Miami Beach, FL, IEEE Computer Society Press, Los Alamitos, CA, 1997, pp. 118-126.
14. M. NAOR, Succinct representation of general unlabeled graphs, Discrete Appl. Math., 28 (1990), pp. 303-307.
15. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, A note on succinct representations of graphs, Inform. and Control, 71 (1986), pp. 181-185.
16. G. TURÁN, On the succinct representation of graphs, Discrete Appl. Math., 8 (1984), pp. 289-294.
17. W. T. TUTTE, A census of planar triangulations, Canad. J. Math., 14 (1962), pp. 21-38.
18. W. T. TUTTE, A census of planar maps, Canad. J. Math., 15 (1963), pp. 249-271.