id	summary	reporter	owner	description	type	status	milestone	component	version	severity	resolution	keywords	cc
694	Add Maximum Common Subgraph (MCS) algorithm	wegner	jsiek	"{{{
A very easy way to implement this is to generate a
product graph of two graphs and find cliques in this graph.
Every clique is a MCS.

I prefer that you provide the base objects for that
instead of implementing them on my own.

We need this for the OpenBabel project finding MCS in
molecules. BTW, a short hint how to transform a
molecule into a nominal or numerical labelled graph
would be nice.

And the product graph should allow both label types.
}}}"	Feature Requests	closed		graph	None		fixed