11 search results - page 2 / 3 » Local resilience of almost spanning trees in random graphs |
SAC
2003
ACM
13 years 10 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...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
AINA
2007
IEEE
13 years 11 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
CISS
2007
IEEE
13 years 8 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
COLING
2002
13 years 4 months ago
2002
Ambiguity is very high for location names. For example, there are 23 cities named `Buffalo' in the U.S. Country names such as `Canada', `Brazil' and `China' ar...