47 search results - page 2 / 10 » A minimum spanning tree algorithm with Inverse-Ackermann typ... |
141
click to vote
OPODIS
2001
15 years 4 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...
114
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
144
click to vote
ICPADS
2007
IEEE
15 years 9 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...
124
click to vote
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
142
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...