11381 search results - page 291 / 2277 » Connectivity |
149
click to vote
ENDM
2002
15 years 6 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...
167
click to vote
DM
1998
15 years 6 months ago
1998
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...
144
click to vote
PROCEDIA
2010
15 years 5 months ago
2010
Psychological literature shows that people do not always make rational choices with respect to whom to collaborate with. Providing the value of candidate connections may help them...
333
Voted
AAECC
2011
Springer
15 years 1 months ago
2011
Springer
A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman’s algorithm. Algebra...
174
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
Wavemesh is a powerful scheme for 3D triangular mesh processing. In sharp contrast with other approaches using wavelets for mesh compression which apply only to meshes having subd...