2095 search results - page 161 / 419 » Improved pebbling bounds |
163
click to vote
STACS
2007
Springer
16 years 18 days ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
169
click to vote
COMPGEOM
2006
ACM
16 years 14 days ago
2006
ACM
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
148
click to vote
PODC
2005
ACM
16 years 1 days ago
2005
ACM
— We consider the problem of reliable broadcast in an infinite grid (or finite toroidal) radio network under Byzantine and crash-stop failures. We present bounds on the maximum...
172
click to vote
GD
2004
Springer
15 years 12 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
162
click to vote
GD
2003
Springer
15 years 11 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...