Join Our Newsletter

COCOC

1995

9 years 3 months ago
1995

We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric diﬀerence of their edge sets. A central spanning tree o...

ISAAC

1998

Springer

9 years 4 months ago
1998

Springer

Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...

SIGCOMM

2000

ACM

9 years 4 months ago
2000

ACM

As the number of hosts attached to a network increases beyond what can be connected by a single local area network (LAN), forwarding packets between hosts on different LANs become...

WDAG

2001

Springer

9 years 4 months ago
2001

Springer

Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...

FSTTCS

2001

Springer

9 years 4 months ago
2001

Springer

Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...

SAC

2003

ACM

9 years 5 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...

COMPGEOM

2003

ACM

9 years 5 months ago
2003

ACM

Let τK be the worst-case (supremum) ratio of the weight of the minimum degree-K spanning tree to the weight of the minimum spanning tree, over all ﬁnite point sets in the Eu

GECCO

2004

Springer

9 years 5 months ago
2004

Springer

Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...

EUROPAR

2004

Springer

9 years 5 months ago
2004

Springer

Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...

ESA

2004

Springer

9 years 5 months 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...