An approach to graph and netlist compression

Data Compression Conference Proceedings

Volumn , Issue , 2008, Pages 33-42

  Jeehong, Yang ^a   Savari, Serap A ^b   Mencer, Oskar ^c  

^a The Department of Civil and Environmental Engineering   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

^c IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BYTE STREAMS; COMPRESSED FILES; COMPRESSION ALGORITHMS; GRAPH COMPRESSION; GRAPH MINING; GRAPH-BASED; LOSSLESS; NET LIST; TEXT COMPRESSIONS;

ALGORITHMS; GRAPH THEORY; MICROWAVE ANTENNAS;

DATA COMPRESSION;

EID: 50249099292     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2008.65     Document Type: Conference Paper

References (20)

1. J. Adiego, G. Navarro, and P. de la Fuente, "Lempel-Ziv compression of structured text", Proc. of the 2004 Data Compression Conference (DCC 2004), pp.112-121, 2004.
2. D. Blandfordm, "Compact data structures with fast queries", Ph.D. thesis, School of Computer Science, Carnegie Mellon University. 2006.
3. J. Cheney, "Compressing XML with multiplexed hierarchical PPM models", Proc. of the 2001 Data Compression Conference (DCC01), pp.163-172, 2001.
4. F. Claude and G. Navarro, "A Fast and Compact Web Graph Representation", Proc. of the SPIRE'07, pp. 105-116. 2007.
5. D.J. Cook and L.B. Holder, Mining Graph Data, Wiley-Interscience, Hoboken, New Jersey, 2006.
6. D.J. Cook and L.B. Holder, "Substructure Discovery Using Minimum Description Length and Background Knowledge", Journal of Artificial Intelligence Research, Vol. 1, p.231-255, 1994.
7. N. Deo, B. Litow, "A structural approach to graph compression", Proc. of MFCS Workshop on Communication, pp. 91-101, 1998.
8. H. Gabow, "Implementation of Algorithms for Maximum Matching on Nonbipartite Graphs", Ph.D. thesis, Stanford University, 1973.
9. X. He, M-Y. Kao, and H-I. Lu, "Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings", SIAM Journal on Discrete Mathematics, Vol. 12(3), pp.317-325, 1999.
10. L.B. Holder, D.J. Cook, J. Gonzalez, and I. Jonyer. "Structural Pattern Recognition in Graphs", Pattern Recognition and String Matching, Kluwer Academic Publishers, 2002
11. J. Huan, W. Wang, and J. Prins, ''Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism", Third IEEE International Conference on Data Mining (ICDM03), p.549, 2003.
12. ISCAS'89 Benchmark Suite (in EDIF file format), http://www.fm.vslib.cz/ ~kes/asic/iscas.
13. A. Itai and M. Rodeh, "Representation of Graphs", ACTA Informatica, Vol 17, pp.215-219, 1982.
14. M. Kuramochi and G. Karypis, "Finding Frequent Patterns in a Large Sparse Graph", Data Mining and Knowledge Discovery, Vol 11(3), pp. 243-271, 2005.
15. M. Mahoney, "Adaptive Weighing of Context Models for Lossless Data Compression", Florida Tech. Technical Report CS-2005-16, 2005.
16. S. Nijssen and J.N. Kok, "A Quickstart in Frequent Structure Mining can make a Difference", Proc. of the tenth International Conference on Knowledge Discovery and Data Mining, p.647-652, 2004.
17. L. Peshkin, "Structure induction by lossless graph compression". Proc. of the 2007 Data Compression Conference (DCC07), pp.53-62, 2007.
18. P. Stanford and P. Mancuso, EDIF: Electronic Design Interchange Format Version 2 0 0, Electronic Industries Association, ANSI/EIA-548-1988, 1988.
19. M. Talamo and P. Vocea, "Representing graphs implicitly using almost optimal space", Discrete Applied Mathematics, Vol. 108(1), pp. 193-210, 2001.
20. X. Yan and J. Han, "gSpan: Graph-Based Substructure Pattern Mining", Proc. of the 2002 International Conference on Data Mining (ICDM02), pp.721, 2002.