6 search results - page 1 / 2 » Induced Matchings in Subcubic Planar Graphs |
ESA
2010
Springer
13 years 6 months ago
2010
Springer
ICCV
2007
IEEE
13 years 11 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
FAW
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
IWPEC
2009
Springer
13 years 11 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...
COMBINATORICS
2000
13 years 4 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...