4137 search results - page 13 / 828 » On the number of matchings of a tree |
DCC
2009
IEEE
14 years 8 months ago
2009
IEEE
SSPR
2004
Springer
14 years 1 months ago
2004
Springer
Concavity trees are structures for 2-D shape representation. In this paper, we present a new recursive method for concavity tree matching that returns the distance between two attr...
DEXA
2005
Springer
14 years 1 months ago
2005
Springer
XML query processing is one of the most active areas of database research. Although the main focus of past research has been the processing of structural XML queries, there are gro...
COMBINATORICS
2006
13 years 7 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
DM
2006
13 years 7 months ago
2006
The forcing number of a perfect matching M of a graph G is the cardinality of the smallest subset of M that is contained in no other perfect matching of G. In this paper, we demon...