3471 search results - page 670 / 695 » Obstacle Numbers of Graphs |
118
Voted
IMC
2003
ACM
15 years 8 months ago
2003
ACM
Border Gateway Protocol allows Autonomous Systems (ASs) to apply diverse routing policies for selecting routes and for propagating reachability information to other ASs. Although ...
152
Voted
MOBICOM
2003
ACM
15 years 8 months ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
148
Voted
MOBICOM
2003
ACM
15 years 8 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
125
Voted
PODC
2003
ACM
15 years 8 months ago
2003
ACM
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
165
Voted
SAC
2003
ACM
15 years 8 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...