Compact representations of separable graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 679-688

  Blandford, Daniel K ^a   Blelloch, Guy E ^a   Kash, Ian A ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA COMPRESSION; FINITE ELEMENT METHOD; GRAPH THEORY; INTERNET; THEOREM PROVING; THREE DIMENSIONAL; VLSI CIRCUITS;

COMPACT REPRESENTATIONS; SEPARABLE GRAPHS;

DATA STRUCTURES;

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

References (30)

1. M. Adler and M. Mitzenmacher. Towards compressing web graphs. In Data Compression Conference (DCC), pages 203-212, 2001.
2. C. J. Alpert. The ISPD circuit benchmark suite. In ACM International Symposium on Physical Design, pages 80-85, Apr. 1998.
3. D. Blandford and G. Blelloch. Index compression through document reordering. In Data Compression Conference (DCC), pages 342-351, 2002.
4. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the web. WWW9 / Computer Networks, 33(1-6):309-320, 2000.
5. Y.-T. Chiang, C.-C. Lin, and H.-I. Lu. Orderly spanning trees with applications to graph encoding and graph drawing. In SODA, pages 506-515, 2001.
6. R. C.-N. Chuang, A. Gang, X. He, M.-Y. Kao, and H.-I. Lu. Compact encodings of planar graphs via canonical orderings and multiple parentheses. Lecture Notes in Computer Science, 1443:118-129, 1998.
7. Deo and Litow. A structural approach to graph compression. In MFCS Workshop on Communications, 1998.
8. P. Elias. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, IT-21(2):194-203, March 1975.
9. Google. Google programming contest web data. http://www.google.com/programming-contest/, 2002.
10. X. He, M.-Y. Kao, and H.-I. Lu. Linear-time succinct encodings of planar graphs via canonical orderings. SIAM J. on Discrete Mathematics, 12(3):317-325, 1999.
11. X. He, M.-Y. Kao, and H.-I. Lu. A fast general methodology for information-theoretically optimal encodings of graphs. SIAM J. Computing, 30(3):838-846, 2000.
12. G. Jacobson. Space-efficient static trees and graphs. In 30th FOCS, pages 549-554, 1989.
13. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. Technical Report TR 95-035 1995.
14. K. Keeler and J. Westbrook. Short encodings of planar graphs and maps. Discrete Applied Mathematics, 58:239-252, 1995.
15. F. T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems, with applications to approximation algorithms, In FOCS, pages 422-431, 1988.
16. R. J. Lipton, D. J. Rose, and R. E. Tarjan. Generalized nested dissection. SIAM Journal on Numerical Analysis, 16:346-358, 1979.
17. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM J. Applied Mathematics, 36:177-189, 1979.
18. H.-I. Lu. Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits. In SODA, pages 223-224, 2002.
19. G. L. Miller, S.-H. Teng, W. P. Thurston, and S. A. Vavasis. Separators for sphere-packings and nearest neighbor graphs. Journal of the ACM, 44:1-29, 1997.
20. J. I. Munro. Tables. In 16th FST & TCS, volume 1180 of LNCS, pages 37-42, Springer-Verlag, 1996.
21. J. I. Munro and V. Raman. Succinct representation of balanced parentheses, static trees and planar graphs. In 38th FOCS, pages 118-126, 1997.
22. M. Naor. Succinct representation for general unlabeled graphs. Discrete Applied Mathematics, 28:303-308, 1990.
23. J. Rossignac. Edgebreaker: Connectivity compression for triangle meshes. IEEE Transactions on Visualization and Computer Graphics, 5(1):47-61, 1999.
24. SCAN project. Internet maps. http://www.isi.edu/scan/mercator/maps.html, 2000.
25. T. Suel and J. Yuan. Compressing the graph structure of the web. In Data Compression Conference (DCC), pages 213-222, 2001.
26. G. Turán. Succinct representations of graphs. Discrete Applied Mathematics, 8:289-294, 1984.
27. U.S. Census Bureau. UA Census 2000 TIGER/Line file download page. http://www.census.gov/geo/www/tiger/tigerua/ua_tgr2k.html, 2000.
28. C. Walshaw, Graph partitioning archive. http://www.gre.ac.uk/~c.walshaw/partition/, 2002.
29. D. Watts and S. Strogatz. Collective dynamics of small-world networks. Nature, 363:202-204, 1998.
30. I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes. Morgan Kaufman, 1999.