|
|
|
|
|
Stefano Quer, Andrea Marcelli and Giovanni Squillero
The maximum common subgraph of two graphs is the largest possible common subgraph, i.e., the common subgraph with as many vertices as possible. Even if this problem is very challenging, as it has been long proven NP-hard, its countless practical applicat...
ver más
|
|
|
|
|