1056 search results - page 30 / 212 » Constraint-Based Graph Matching |
3DIM
2005
IEEE
14 years 2 months ago
2005
IEEE
Automatic range image registration without any knowledge of the viewpoint requires identification of common regions across different range images and then establishing point corr...
VL
1994
IEEE
14 years 1 months ago
1994
IEEE
Stretch-A-Sketch is a pen-based drawing program that combines recognition of hand-drawn glyphs with constraint based maintenance of spatial relations. The recognition program iden...
SODA
1993
ACM
13 years 10 months ago
1993
ACM
We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched...
DM
2006
13 years 9 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...
COMBINATORICS
2006
13 years 9 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...