3396 search results - page 467 / 680 » Tree representations of graphs |
161
click to vote
WADS
1993
Springer
15 years 10 months ago
1993
Springer
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
167
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
177
click to vote
RSS
2007
15 years 8 months ago
2007
Abstract— This paper presents the Discrete Search Leading continuous eXploration (DSLX) planner, a multi-resolution approach to motion planning that is suitable for challenging p...
180
click to vote
ICALP
2005
Springer
16 years 3 days ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
158
click to vote
SSS
2005
Springer
16 years 2 days ago
2005
Springer
This paper considers the self-stabilizing unison problem. The contribution of this paper is threefold. First, we establish that when any self-stabilizing asynchronous unison protoc...