Join Our Newsletter

283 search results - page 2 / 57» The saga of minimum spanning trees |

CORR

2006

Springer

9 years 5 months ago
2006

Springer

Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...

CCCG

2006

9 years 7 months ago
2006

We show that any tree whose maximum degree is at most 10 can be drawn in 3-space such that it is the minimum spanning tree of its vertices.

GECCO

2006

Springer

9 years 9 months ago
2006

Springer

A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...

SODA

2004

ACM

9 years 7 months ago
2004

ACM

Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...

CATS

2007

9 years 7 months ago
2007

Given a set S of n points in the plane, a minimumdilation spanning tree of S is a tree with vertex set S of smallest possible dilation. We show that given a set S of n points and ...