1056 search results - page 17 / 212 » Constraint-Based Graph Matching |
CORR
2007
Springer
13 years 9 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
GBRPR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...
AGTIVE
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...
DM
2006
13 years 9 months ago
2006
The resonance graph R(B) of a benzenoid graph B has the perfect matchings of B as vertices, two perfect matchings being adjacent13 if their symmetric difference forms the edge set...
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...