Sciweavers

723 search results - page 45 / 145
» On the hyperbolicity constant in graphs
Sort
View
COCOON
2006
Springer
15 years 8 months ago
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishiz...
ENDM
2008
118views more  ENDM 2008»
15 years 6 months ago
Number of Crossing-Free Geometric Graphs vs. Triangulations
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
Andreas Razen, Jack Snoeyink, Emo Welzl
CPC
2007
76views more  CPC 2007»
15 years 6 months ago
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n−1 + λn−4/...
Svante Janson, Joel Spencer
GC
2002
Springer
15 years 6 months ago
A Note on Cycle Lengths in Graphs
We prove that for every c > 0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even...
Ronald J. Gould, Penny E. Haxell, A. D. Scott
STACS
2010
Springer
16 years 1 months ago
Relaxed Spanners for Directed Disk Graphs
Let (V, δ) be a finite metric space, where V is a set of n points and δ is a distance function defined for these points. Assume that (V, δ) has a constant doubling dimension d...
David Peleg, Liam Roditty