4865 search results - page 468 / 973 » The Complexity of Graph Connectivity |
202
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
204
click to vote
INFOCOM
2005
IEEE
16 years 16 days ago
2005
IEEE
— We present Gradient Landmark-Based Distributed Routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating node...
202
click to vote
ICDCS
2002
IEEE
15 years 12 months ago
2002
IEEE
The need for sharing is well known in a large number of distributed collaborative applications. These applications are difficult to develop for wide area (possibly mobile) networ...
183
click to vote
IPPS
2002
IEEE
15 years 12 months ago
2002
IEEE
This paper addresses the problem of scatternet formation and maintenance for multi-hop Bluetooth based personal area and ad hoc networks with minimal communication overhead. Each ...
169
click to vote
COCOON
2001
Springer
15 years 11 months ago
2001
Springer
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...