Maximum Common Subgraph

[ Follow Ups ] [ Post Followup ] [ Algorithm Repository Bulliten Board ] [ FAQ ]

Posted by Angus MacLean on July 07, 19100 at 07:34:12:

Hi All,

I am looking for an algorithm that will allow
me to establish the MCS for a pair of *labelled*
(vertices and edges), *directed* graphs, generally
*low valency* but *arbitrary size*!

*ANY* help/guidance would be very welcome.

Thanks,
Angus:-)

Follow Ups:


Post a Followup

Name:
E-Mail:

Subject:

Comments:

Optional Link URL:
Link Title:
Optional Image URL:

[ Follow Ups ] [ Post Followup ] [ Algorithm Repository Bulliten Board ] [ FAQ ]