209 search results - page 2 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
69
Voted
EUROPAR
2007
Springer
15 years 3 months ago
2007
Springer
In many network applications the computation takes place on the minimum-cost spanning tree (MST) of the network; unfortunately, a single link or node failure disconnects the tree. ...
77
Voted
SPAA
1998
ACM
15 years 3 months ago
1998
ACM
113
click to vote
ICPADS
2007
IEEE
15 years 5 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...
101
Voted
SRDS
1998
IEEE
15 years 3 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
JPDC
2006
14 years 11 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...