Sciweavers

Share
41 search results - page 1 / 9
» A Relational View of Subgraph Isomorphism
Sort
View
RELMICS
2000
Springer
9 years 10 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, ...
Jordi Cortadella, Gabriel Valiente
CORR
1999
Springer
145views Education» more  CORR 1999»
9 years 6 months ago
Subgraph Isomorphism in Planar Graphs and Related Problems
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
David Eppstein
CORR
2008
Springer
123views Education» more  CORR 2008»
9 years 7 months ago
On the graph isomorphism problem
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is relate...
Shmuel Friedland
FPL
2000
Springer
103views Hardware» more  FPL 2000»
9 years 10 months ago
Evaluation of Accelerator Designs for Subgraph Isomorphism Problem
Many applications can be modeled as subgraph isomorphism problems. However, this problem is generally NP-complete and difficult to compute. A custom computing circuit is a prospect...
Shuichi Ichikawa, Hidemitsu Saito, Lerdtanaseangth...
APIN
2006
109views more  APIN 2006»
9 years 7 months ago
Visual analogy: Viewing analogical retrieval and mapping as constraint satisfaction problems
The core issue of analogical reasoning is the transfer of relational knowledge from a source case to a target problem. Visual analogical reasoning pertains to problems containing ...
Patrick W. Yaner, Ashok K. Goel
books