286 search results - page 7 / 58 » Recognition Algorithm for Diamond-Free Graphs |
CVPR
2003
IEEE
15 years 27 days ago
2003
IEEE
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
COLOGNETWENTE
2009
13 years 12 months ago
2009
: Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
STACS
2010
Springer
14 years 5 months ago
2010
Springer
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
CAIP
2009
Springer
14 years 5 months ago
2009
Springer
Measures of central tendency for graphs are important for protoype construction, frequent substructure mining, and multiple alignment of protein structures. This contribution propo...
CVPR
2008
IEEE
15 years 27 days ago
2008
IEEE
letons to Bone Graphs: Medial Abstraction for Object Recognition Diego Macrini University of Toronto Kaleem Siddiqi McGill University Sven Dickinson University of Toronto Medial d...