[Boost-users] [Graph] Maximum common subgraph

From: Andreas Sæbjørnsen (andreas.saebjoernsen_at_[hidden])
Date: 2006-01-04 13:49:21

Hi,
Lately I have been looking for a good C/C++ implementation of an algorithm
for finding the maximum common subgraph in Boost::Graph. The algorithms I
have looked for is mainly  Bron-Kerbosch and the MCS  algorithm, but I am
very open for alternatives.  The implementation must be able to handle
directed graphs containing self-loops (it is possible to have two edges at
the same time between two nodes i->j, j->i). Do you know of any
implementation?

Thanks
Andreas Saebjornsen