2695 search results - page 23 / 539 » Learning Graph Matching |
89
Voted
CORR
2007
Springer
15 years 1 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...
103
click to vote
COMBINATORICA
2010
14 years 8 months ago
2010
We prove that every rayless graph has an unfriendly partition.
127
click to vote
GBRPR
2005
Springer
15 years 7 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...
116
click to vote
AGTIVE
2007
Springer
15 years 8 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...
83
Voted
DM
2006
15 years 1 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...