This repository is not active
kazimierz-256/Maximum-common-unlabelled-subgraph-algorithm
An exact algorithm for finding the maximum common induced subgraph of two unlabelled graphs. Two derivative approximating algorithms are also implemented. All rights reserved.
C#NOASSERTION