Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

GBRPR
2005
Springer

favoriteEmaildiscussreport

120views Pattern Recognition» more GBRPR 2005»

A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs

13 years 10 months ago

A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs

Download users.info.unicaen.fr

Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an eﬃcient generation of the common connected induced subgraphs of the input graphs. Experimental results are provided.

Bertrand Cuissart, Jean-Jacques Hébrard

Real-time Traffic

Connected Induced Subgraphs | Direct Algorithm | GBRPR 2005 | Input Graphs |

claim paper

Related Content

» A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem

» Maximum common subgraph some upper bound and lower bound results

» The Maximum Common Subgraph Problem Faster Solutions via Vertex Cover

» Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs

» Isomorphic Subgraphs

» Competitive graph searches

» Common visual pattern discovery via spatially coherent correspondences

» Structure of Neighborhoods in a Large Social Network

» On extracting consistent graphs in wireless sensor networks

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	GBRPR
Authors	Bertrand Cuissart, Jean-Jacques Hébrard

Comments (0)