[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[igraph] Maximum Common Subgraph

From: Mark Galea
Subject: [igraph] Maximum Common Subgraph
Date: Fri, 11 Mar 2011 03:32:32 +0000

Hi there,

I am trying to find to get the maximum common subgraph given two
graphs however I cannot seem to find this in the library.  Am I
missing something?

Given that Graph 1 is

A - B
A - C
B - D
D - E

Graph 2 is

A - B
A - E
B - D

Than the algorithm should return
A - B
B - D

Sub-isomorphism is not taking into account the unique node labels.  Is
there a way to do this? It is a bit odd that such a functionality is
not provided.

Regards ,


reply via email to

[Prev in Thread] Current Thread [Next in Thread]