DocumentCode :
2756014
Title :
An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits
Author :
Rutgers, Jochem H. ; Wolkotte, Pascal T. ; Hölzenspies, Philip K F ; Kuper, Jan ; Smit, Gerard J M
Author_Institution :
Dept. of EEMCS, Univ. of Twente, Enschede, Netherlands
fYear :
2010
fDate :
1-3 Sept. 2010
Firstpage :
699
Lastpage :
705
Abstract :
This paper presents an approximate Maximum Common Sub graph (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 sub graphs 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.
Keywords :
circuit complexity; digital circuits; directed graphs; field programmable gate arrays; MCS algorithm; approximate maximum common subgraph algorithm; computational complexity; cyclic graphs; directed graphs; large digital circuits; Algorithm design and analysis; Approximation algorithms; Complexity theory; Computer architecture; Field programmable gate arrays; Microprocessors; Niobium;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Digital System Design: Architectures, Methods and Tools (DSD), 2010 13th Euromicro Conference on
Conference_Location :
Lille
Print_ISBN :
978-1-4244-7839-2
Type :
conf
DOI :
10.1109/DSD.2010.29
Filename :
5615521
Link To Document :
بازگشت