672 search results - page 7 / 135 » Lower-stretch spanning trees |
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
JCM
2006
13 years 7 months ago
2006
One of the most common communication patterns in sensor networks is routing data to a base station, while the base station can be either static or mobile. Even in static cases, a s...
APPML
2010
13 years 7 months ago
2010
We introduce the concept of single-linkage equivalence of edge-weighted graphs, we apply it to characterise maximal spanning trees and "ultrasimilarities", and we discus...
COMBINATORICA
2004
13 years 7 months ago
2004
We extend the basic theory concerning the cycle space of a finite graph to infinite locally finite graphs, using as infinite cycles the homeomorphic images of the unit circle in t...
ESA
2004
Springer
14 years 26 days ago
2004
Springer
Let G = (V, E) be an undirected multi-graph with a special vertex root ∈ V , and where each edge e ∈ E is endowed with a length l(e) ≥ 0 and a capacity c(e) > 0. For a pa...