168 search results - page 33 / 34 » New upper bounds on the decomposability of planar graphs |
SWAT
2004
Springer
14 years 1 days ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
AHSWN
2008
13 years 6 months ago
2008
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
MOBIHOC
2004
ACM
14 years 6 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
SPAA
2005
ACM
14 years 8 days ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...