97 search results - page 4 / 20 » Pair lengths of product graphs |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
JCT
2006
13 years 7 months ago
2006
We consider the class A of graphs that contain no odd hole, no antihole, and no "prism" (a graph consisting of two disjoint triangles with three disjoint paths between th...
CHI
2011
ACM
12 years 11 months ago
2011
ACM
Many people read online reviews written by other users to learn more about a product or venue. However, the overwhelming amount of user-generated reviews and variance in length, d...
COMBINATORICA
2007
13 years 7 months ago
2007
What is the maximum possible number, f3(n), of vectors of length n over {0, 1, 2} such that the Hamming distance between every two is even? What is the maximum possible number, g3...
ECCV
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Finding point correspondences plays an important role in automatically building statistical shape models from a training set of 3D surfaces. For the point correspondence ...