142 search results - page 3 / 29 » Filtering for Subgraph Isomorphism |
95
Voted
ICPR
2000
IEEE
16 years 3 months ago
2000
IEEE
155
click to vote
CORR
1999
Springer
15 years 2 months ago
1999
Springer
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 ...
148
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
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...
129
click to vote
AAAI
1994
15 years 3 months ago
1994
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
108
Voted
GC
2007
Springer
15 years 2 months ago
2007
Springer
Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V (G) (the ground set) the image of V (H) under the isomorphism. We consider...