An experimental analysis of a compact graph representation

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2004, Pages 49-61

  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

ASYMPTOTIC CHARACTERISTICS; COMPACT GRAPH REPRESENTATION; EDGE DELETION; FINITE ELEMENT MESHES;

ALGORITHMS; BUFFER STORAGE; ENCODING (SYMBOLS); FINITE ELEMENT METHOD; ROUTERS; SEPARATORS;

GRAPH THEORY;

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

References (36)

1. C. J. Alpert. The ISPD circuit benchmark suite. In ACM International Symposium on Physical Design, pages 80-85, Apr. 1998.
2. C. J. Alpert and A. Kahng. Recent directions in netlist partitioning: A survey. VLSI Journal, 19(1-2):1-81, 1995.
3. D. Blandford and G. Blelloch. Index compression through document reordering. In Data Compression Conference (DCC), pages 342-351, 2002.
4. D. Blandford, G. Blelloch, D. Cardoze, and C. Kadow. Compact representations of simplicial meshes in two and three dimensions. In International Meshing Roundtable (IMR), pages 135-146, Sept. 2003.
5. D. Blandford, G. Blelloch, and I. Kash. Compact representations of separable graphs. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pages 342-351, 2003.
6. 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.
7. T. M. Chilimbi, M. D. Hill, and J. R. Larus. Cache-conscious structure layout. In Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, pages 1-12, 1999.
8. 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. Lecture Notes in Computer Science, 1443:118-129, 1998.
9. P. Elias. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, IT-21(2):194-203, March 1975.
10. Google. Google programming contest web data, http://www.google.com/ programming-contest/, 2002.
11. H. Han and C.-W. Tseng. A comparison of locality transformations for irregular codes. In Proc. Languages, Compilers, and Run-Time Systems for Scalable Computers, pages 70-84, 2000.
12. 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.
13. 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.
14. G. Jacobson. Space-efficient static trees and graphs. In 30th FOCS, pages 549-554, 1989.
15. K. Keeler and J. Westbrook. Short encodings of planar graphs and maps. Discrete Applied Mathematics, 58:239-252, 1995.
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. K. Mehlhorn and S. Naber. LEDA: A platfor for combinatorial and geometric computing. Cambridge University Press, 1999.
20. 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.
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. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.
23. A. L. Rosenberg and L. S. Heath. Graph Separators, with Applications. Kluwer Academic/Plenum Publishers, 2001.
24. J. Rossignac. Edgebreaker: Connectivity compression for triangle meshes. IEEE Transactions on Visualization and Computer Graphics, 5(1):47-61, /1999.
25. SCAN project. Internet maps. http://www.isi.edu/scan/mercator/maps.html, 2000.
26. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
27. H. D. Simon. Partitioning of unstructured problems for parallel processing. Computing Systems in Engineering, 2:135-148, 1991.
28. J. Sperling. Development and maintenance of the tiger database: Experiences in spatial data sharing at the u.s. bureau of the census. In Sharing Geographic Information, pages 377-396, 1995.
29. A. Strehl and J. Ghosh. A scalable approach to balanced, high-dimensional clustering of market-baskets. In Proc. of the Seventh International Conference on High Performance Computing (HiPC 2000), volume 1970 of Lecture Notes in Computer Science, pages 525-536. Springer, Dec. 2000.
30. A. Szymczaka and J. Rossignac. Grow & Fold: compressing the connectivity of tetrahedral meshes. Computer-Aided. Design, 32:527-537, 2000.
31. S. Toledo. Improving the memory-system performance of sparse-matrix vector multiplication. IBM Journal of Research and Development, 41(6):711-726, 1997.
32. G. Turán. Succinct representations of graphs. Discrete Applied Mathematics, 8:289-294, 1984.
33. J. D. Ullman. Computational Aspects of VLSI. Computer Science Press, Rockville, MD, 1984.
34. U.S. Census Bureau. UA Census 2000 TIGER/Line file download page. http://www.census.gov/geo/www/tiger/tigerua/ua_tgr2k.html, 2000.
35. C. Walshaw. Graph partitioning archive. http://www.gre.ac.uk/~c.walshaw/ partition/, 2002.
36. D. Watts and S. Strogatz. Collective dynamics of small-world networks. Nature, 363:202-204, 1998.