212 search results - page 4 / 43 » Subgraph Isomorphism in Planar Graphs and Related Problems |
124
Voted
ISAAC
2010
Springer
14 years 10 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
132
Voted
CONSTRAINTS
2010
14 years 10 months ago
2010
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
88
Voted
DM
2002
15 years 11 days ago
2002
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgrap...
114
Voted
MST
2011
14 years 3 months ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
108
click to vote
ICDAR
2009
IEEE
14 years 10 months ago
2009
IEEE
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...