212 search results - page 25 / 43 » Subgraph Isomorphism in Planar Graphs and Related Problems |
139
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
136
click to vote
PVLDB
2010
15 years 2 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
122
click to vote
CCCG
2007
15 years 5 months ago
2007
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
141
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
138
click to vote
GC
2007
Springer
15 years 4 months ago
2007
Springer
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...