Maximum Common Subgraph on Graph with Labelled Vertices and Edges

[Michael Anslow]

Hi all,

I'm working with directed graphs for which vertices and edges are labelled. 

I'd like to find the maximum common subgraph between two graphs. Ideally if there are multiple maximum common subgraphs I would like to know how many there are. 

Is this supported?

Thanks,

Michael

[Luc Hogie]

Hi Michael,

Grph no algorithm that natively features this. However it comes with algorithms that can find subgraphs according to given patterns. You would

need to iterate over the set of subgraph, which un unpracticable. :(

--
You received this message because you are subscribed to the Google Groups "Grph: High Performance Graph Library for Java" group.
To unsubscribe from this group and stop receiving emails from it, send an email to grph-high-performance-gr...@googlegroups.com.
To post to this group, send email to grph-high-performa...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

--

Luc Hogie 

Phone: 06 80 91 40 71

Skype: luchogie

"Je suis heureux parce que c'est bon pour la santé" Voltaire

[sara.e...@gmail.com]

Hi Michael,

Did you find a program for extracting the maximum common subgraph?

Thanks,