An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits

Jochem H. Rutgers, Pascal T. Wolkotte, Philip K. F. Hölzenspies, Jan Kuper, Gerard J. M. Smit. An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits. In Sebastián López, editor, 13th Euromicro Conference on Digital System Design, Architectures, Methods and Tools, DSD 2010, 1-3 September 2010, Lille, France. pages 699-705, IEEE, 2010. [doi]

Authors

Jochem H. Rutgers

This author has not been identified. Look up 'Jochem H. Rutgers' in Google

Pascal T. Wolkotte

This author has not been identified. Look up 'Pascal T. Wolkotte' in Google

Philip K. F. Hölzenspies

This author has not been identified. Look up 'Philip K. F. Hölzenspies' in Google

Jan Kuper

This author has not been identified. Look up 'Jan Kuper' in Google

Gerard J. M. Smit

This author has not been identified. Look up 'Gerard J. M. Smit' in Google