1 paper
Manuel Lafond, Bertrand Marchand
In this work, we study the problem of computing a maximum common contraction of two vertex-labeled graphs, i.e. how to make them identical by contracting as little edges as possibl…