Login / Signup

An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits.

Jochem H. RutgersPascal T. WolkottePhilip K. F. HölzenspiesJan KuperGerard J. M. Smit
Published in: DSD (2010)
Keyphrases
  • np hard
  • k means
  • optimal solution
  • database
  • dynamic programming
  • matching algorithm
  • digital circuits
  • clustering method
  • similarity measure
  • search space
  • maximum common subgraph