An Approach to Graph and Netlist Compression

We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph mining tool SUBDUE. Our algorithm, CEDIF (Compressed EDIF), compresses the EDIF file about 2 - 3% more than the state-of-the-art PAQ text compression algorithm. We also developed a heuristic partitioning algorithm that tries to avoid hurting frequent subgraph patterns by the partitioning process to speed up the graph mining process, and introduced a way to use graph mining tools as a graph compressor so that the compressed graph could be decompressed.

• Type: Conference
• Year: 2008
• Where: DCC
• Authors: Jeehong Yang, Serap A. Savari, Oskar Mencer
• Keywords: Computer Graphics, DCC 2008, Graph Mining Process, Graph Mining Tool, Netlist Graph Algorithm