Feature Requests item #1530990, was opened at 2006-07-29 21:24 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=357586&aid=1530990&group_id=7586 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: graph Group: None Status: Open Resolution: None Priority: 5 Submitted By: Joerg Kurt Wegner (wegner) Assigned to: Jeremy Siek (jsiek) Summary: Add Maximum Common Subgraph (MCS) algorithm Initial Comment: 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. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=357586&aid=1530990&group_id=7586 ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys -- and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Boost-bugs mailing list Boost-bugs@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs