723 search results - page 59 / 145 » On the hyperbolicity constant in graphs |
168
click to vote
SPAA
2006
ACM
16 years 7 days ago
2006
ACM
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
130
click to vote
JGT
2007
15 years 6 months ago
2007
Let Γ be an infinite, locally finite, connected graph with distance function δ. Given a ray P in Γ and a constant C ≥ 1, a vertex-sequence {xn}∞ n=0 ⊆ V P is said to be...
139
click to vote
ALGORITHMICA
2002
15 years 6 months ago
2002
We present several simple methods to construct planar, strictly upward, strongly order-preserving, straight-line drawings of any n-node binary tree. In particular, it is shown that...
158
click to vote
COMGEO
2002
ACM
15 years 6 months ago
2002
ACM
A fractal construction shows that, for any > 0, the -skeleton of a point set can have arbitrarily large dilation: (nc ), where c is a constant depending on and going to zero ...
171
click to vote
JCT
2010
15 years 4 months ago
2010
We prove that every graph with maximum degree ∆ can be properly (∆ + 1)coloured so that no colour appears more than O(log ∆/ log log ∆) times in the neighbourhood of any v...