Compact encodings of planar graphs via canonical orderings and multiple parentheses

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1443 LNCS, Issue , 1998, Pages 118-129

  Chuang, Richie Chih Nan ^a   Garg, Ashim ^b   He, Xin ^b   Kao, Ming Yang ^c   Lu, Hsueh I ^a  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

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

^c Yale University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; GRAPH THEORY; GRAPHIC METHODS; SIGNAL ENCODING;

BINARY STRING; CANONICAL ORDERING; CODING SCHEME; ENCODING AND DECODING; ENCODINGS; LINEAR TIME; PLANAR GRAPH;

ENCODING (SYMBOLS);

EID: 84878620879     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055046     Document Type: Conference Paper

References (19)

1. T. BELL, J. G. CLEARY, AND I. WITTEN, Text Compression, Prentice-Hall, 1990.
2. D. R. CLARK, Compact Pat Tree, PhD thesis, University of Waterloo, 1996.
3. H. D. FRAYSSEIX, J. PACH, AND R. POLLACK, HOW to draw a planar graph on a grid, Combinatorica, 10 (1990), pp. 41-51.
4. H. GALPERIN AND A. WIGDERSON, Succinct representations of graphs, Information and Control, 56 (1983), pp. 183-198.
5. A. ITAI AND M. RODEH, Representation of graphs, Acta Informatica, 17 (1982), pp. 215-219.
6. G. JACOBSON, Space-efficient static trees and graphs, in proc. 30th FOCS, 30 Oct.-1 Nov. 1989, pp. 549-554.
7. S. KANNAN, N. NAOR, AND S. RUDICH, Implicit representation of graphs, SIAM Journal on Discrete Mathematics, 5 (1992), pp. 596-603.
8. G. KANT, Drawing planar graphs using the Imc-ordering (extended abstract), in proc. 33rd FOCS, 24-27 Oct. 1992, pp. 101-110.
9. -, Algorithms for Drawing Planar Graphs, PhD thesis, Univ. of Utrecht, 1993.
10. G. KANT AND X. HE, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, TCS 172 (1997), pp. 175-193.
11. M. Y. KAO, M. FÜRER, X. HE, AND B. RAGHAVACHARI, Optimal parallel algorithms for straight-line grid embeddings of planar graphs, SIAM Journal on Discrete Mathematics, 7 (1994), pp. 632-646.
12. M. Y. KAO AND S. H. TENG, Simple and efficient compression schemes for dense and complement graphs, in Fifth Annual Symposium on Algorithms and Computation, LNCS 834, Beijing, China, 1994, Springer-Verlag, pp. 201-210.
13. K. KEELER AND J. WESTBROOK, Short encodings of planar graphs and maps, Discrete Applied Mathematics, 58 (1995), pp. 239-252.
14. J. I. MUNRO, Tables, in proc. of 16th Conf. on Foundations of Software Technology and Theoret. Comp. Sci., LNCS 1180, 1996, Springer-Verlag, pp. 37-42.
15. J. I. MUNRO AND V. RAMAN, Succinct representation of balanced parentheses, static trees and planar graphs, in proc. 38th FOCS 20-22 Oct. 1997.
16. M. NAOR, Succinct representation of general unlabeled graphs, Discrete Applied Mathematics, 28 (1990), pp. 303-307.
17. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, A note on succinct representations of graphs, Information and Control, 71 (1986), pp. 181-185.
18. W. SCHNYDER, Embedding planar graphs on the grid, in Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, pp. 138-148.
19. G. TURAN, On the succinct representation of graphs, Discrete Applied Mathematics, 8 (1984), pp. 289-294.