723 search results - page 58 / 145 » On the hyperbolicity constant in graphs |
148
click to vote
SIAMDM
2008
15 years 6 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
166
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
170
click to vote
WDAG
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
143
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
142
click to vote
ICMCS
2007
IEEE
16 years 18 days ago
2007
IEEE
Image segmentation has been studied for many years. But what factors influence segmentation results indeed? Why some images are easy to be handled while the others are not? In thi...