Sciweavers

Share
RELMICS
2000
Springer

A Relational View of Subgraph Isomorphism

9 years 9 months ago
A Relational View of Subgraph Isomorphism
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, combined with a representation of relations and graphs by Boolean functions, allows to handle the combinatorial explosion in the case of small pattern graphs and large target graphs by using Binary Decision Diagrams (BDDs), which are capable to represent large relations and graphs in small data structures. Examples are presented that show how all subgraph isomorphisms (120 303) of a small graph into a large graph can be efficiently computed and represented with a small BDD (57 980 nodes).
Jordi Cortadella, Gabriel Valiente
Added 25 Aug 2010
Updated 25 Aug 2010
Type Conference
Year 2000
Where RELMICS
Authors Jordi Cortadella, Gabriel Valiente
Comments (0)
books