An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits

J.H. Rutgers, P.T. Wolkotte, P.K.F. Holzenspies, Jan Kuper, Gerardus Johannes Maria Smit

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    6 Citations (Scopus)
    210 Downloads (Pure)


    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.
    Original languageUndefined
    Title of host publicationProceedings of the 13th Euromicro Conference on Digital System Design: Architectures, Methods and Tools, DSD 2010
    Place of PublicationUSA
    Number of pages7
    ISBN (Print)978-0-7695-4171-6
    Publication statusPublished - 3 Sept 2010
    Event13th EUROMICRO Conference on Digital System Design, DSD 2010: Architectures, Methods and Tools - Lille, France
    Duration: 1 Sept 20103 Sept 2010
    Conference number: 13

    Publication series

    PublisherIEEE Computer Society


    Conference13th EUROMICRO Conference on Digital System Design, DSD 2010
    Abbreviated titleDSD


    • METIS-271013
    • EWI-18373
    • IR-73123

    Cite this