Sciweavers

Share
DSD
2010
IEEE

An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits

10 years 12 months ago
An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application domain, the graphs have nice properties: they are very sparse; have many different labels; and most vertices have only one predecessor. The algorithm iterates over all vertices once and uses heuristics to find the MCS. It is linear in computational complexity with respect to the size of the graph. Experiments show that very large common subgraphs were found in graphs of up to 200,000 vertices within a few minutes, when a quarter or less of the graphs differ. The variation in run-time and quality of the result is low.
Jochem H. Rutgers, Pascal T. Wolkotte, Philip K. F
Added 06 Dec 2010
Updated 06 Dec 2010
Type Conference
Year 2010
Where DSD
Authors Jochem H. Rutgers, Pascal T. Wolkotte, Philip K. F. Hölzenspies, Jan Kuper, Gerard J. M. Smit
Comments (0)
books