3757 search results - page 100 / 752 » The overlap number of a graph |
JCB
2007
14 years 9 months ago
2007
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
EJC
2006
14 years 10 months ago
2006
The general symplectic graph Sp(2, q) is introduced. It is shown that Sp(2, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphis...
ENDM
2002
14 years 9 months ago
2002
We prove that a claw-free, 2-connected graph with fewer than 18 vertices is traceable, and we determine all non-traceable, claw-free, 2-connected graphs with exactly 18 vertices an...
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
DAM
2006
14 years 10 months ago
2006
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...