1 paper
Andrea Marcelli, Stefano Quer, Giovanni Squillero
The Maximum Common Subgraph is a computationally challenging problem with countless practical applications. Even if it has been long proven NP-hard, its importance still motivates…