Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 223-224

  Lu, Hsueh I ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84968911974     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. S. R. Arikati, A. Maheshwari, and C. D. Zaroliagis. Efficient computation of implicit representations of sparse graphs. Discrete Applied Mathematics, 78:1-16, 1997.
2. Y.-T. Chiang, C.-C. Lin, and H.-I. Lu. Orderly spanning trees with applications to graph drawing and graph encoding. In Proceedings of the 12th SODA, pages 506-515, 2001.
3. R. C.-N. Chuang, A. Garg, X. He, M.-Y. Kao, and H.-I. Lu. Compact encodings of planar graphs via canonical ordering and multiple parentheses. In Proceedings of the 25th ICALP, pages 118-129, 1998.
4. N. Deo and B. Litow. A structural approach to graph compression. In Proceedings of MFCS'98 Satellite Workshop on Communications, pages 91-101, 1998.
5. H. N. Djidjev and S. M. Venkatesan. Planarization of graphs embedded on surfaces. In Proceedings of the 21st Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 1017, pages 62-72. Springer, 1995.
6. T. Feder and R. Motwani. Clique partitions, graph compression and speeding-up algorithms. Journal of Computer and System Sciences, 51(2):261-272, 1995.
7. C. Gavoille and N. Hanusse. Compact routing tables for graphs of bounded genus. In Proceedings of the 26th ICALP, pages 351-360, 1999.
8. C. Gavoille and N. Hanusse. On compact encoding of pagenumber k graphs. Submitted for publication, 2001.
9. M. T. Goodrich. Planar separators and parallel polygon triangulation. Jouranl of Computer and System Sciences, 51(3):374-389, 1995.
10. X. He, M.-Y. Kao, and H.-I. Lu. Linear-time succinct encodings of planar graphs via canonical orderings. SIAM J. Discrete Mathematics, 12(3) :317-325, 1999.
11. X. He, M.-Y. Kao, and H.-I. Lu. A fast general methodology for information-theoreticaliy optimal encodings of graphs. SIAM J. Computing, 30(3):838-846, 2000.
12. D. King, http://www.3dcompression.com.
13. B. Mohar. A linear time algorithm for embedding graphs in an arbitrary surface. SIAM Journal on Discrete Mathematics, 12(1):6-26, 1999.
14. J. I. Munro and V. Raman. Succinct representation of balanced parentheses, static trees and planar graphs. In Proceedings of the 38th FOCS, pages 118-126, 1997.
15. J. I. Munro, V. Raman, and A. Storm. Representing dynamic binary trees succinctly. In Proceedings of the 12th SODA, pages 529-536, 2001.
16. R. Pagh. Low redundancy in static dictionaries with constant query time. SIAM Journal on Computing, 31(2):353-363, 2001.
17. J. Rossignac. Edgebreaker: Connectivity compression for triangle meshes. IEEE Transactions on Visualization and Computer Graphics, 5(1):47-61, 1999.
18. J. Rossignac, A. Safonova, and A. Szymczak. 3D compression made simple: Edgebreaker on a corner-table. In Proceedings of the Shape Modeling International Conference, 2001.
19. J. Rossignac and A. Szymczak. Wrap&Zip decompression of the connectivity of triangle meshes compressed with Edgebreaker. Computational Geometry: Theory and Applications, 14(1-3):119-135, 1999.
20. G. Taubin and J. Rossignac. Geometric compression through topological surgery. ACM Transactions on Graphics, 17(2):84-115, 1998.
21. C. Thomassen. The graph genus problem is NP-complete. Journal of Algorithms, 10(4):568-576, 1989.