Sciweavers

140 search results - page 4 / 28
» Computing Minimum Spanning Trees with Uncertainty
Sort
View
ICPADS
2007
IEEE
15 years 10 months ago
Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs
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...
Hoda Akbari, Zeinab Iranmanesh, Mohammad Ghodsi