An Approach to Graph and Netlist Compression

We introduce an EDIF netlist graph-based compression algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains. The algorithm builds on the graph mining tool SUBDUE. Our algorithm, CEDIF (compressed EDIF), compresses the EDIF file to a size about 39% of the size of the compressed file resulting from the state-of-the-art PAQ text compression algorithm and to about 85% of the size of a GRAPHITOUR-like graph compression algorithm.