1729 search results - page 155 / 346 » On Bounds for the k-Partitioning of Graphs |
198
click to vote
ICDCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
183
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
161
click to vote
ICRA
2007
IEEE
16 years 23 days ago
2007
IEEE
Abstract— In this paper, we study the accuracy of Cooperative Localization and Target Tracking (CLATT) in a team of mobile robots, and derive analytical upper bounds for the posi...
159
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
206
click to vote
ADHOCNOW
2004
Springer
15 years 12 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...