119 search results - page 1 / 24 » Linear-Time Algorithms for Parametric Minimum Spanning Tree ... |
LATIN
1995
Springer
13 years 8 months ago
1995
Springer
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...
OPODIS
2001
13 years 5 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
FOCS
1998
IEEE
13 years 8 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
STOC
1996
ACM
13 years 8 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
SOFSEM
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...