334 search results - page 15 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
116
click to vote
ESA
2000
Springer
15 years 4 months ago
2000
Springer
Given a 2-node connected, undirected graph G = (V, E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V, ET ) of G, we study the problem o...
118
click to vote
DEXA
2010
Springer
15 years 1 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
122
click to vote
IPL
2007
15 years 1 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
108
click to vote
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
137
click to vote
CATS
1998
15 years 2 months ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...