334 search results - page 2 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
SPAA
1998
ACM
13 years 9 months ago
1998
ACM
PDCAT
2005
Springer
13 years 11 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
ICPADS
2007
IEEE
13 years 11 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
FSTTCS
2001
Springer
13 years 10 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...
LATIN
1995
Springer
13 years 9 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...