286 search results - page 13 / 58 » Recognition Algorithm for Diamond-Free Graphs |
DAM
2008
14 years 9 months ago
2008
Abstract. A graph is called equistable when there is a nonnegative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stab...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
SSPR
2004
Springer
15 years 2 months ago
2004
Springer
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
GBRPR
2009
Springer
15 years 2 months ago
2009
Springer
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
DAM
1999
14 years 9 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...