50 search results - page 2 / 10 » A Memetic Algorithm for the Optimum Communication Spanning T... |
NETWORKING
2007
13 years 6 months ago
2007
Abstract. We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning...
ICCNMC
2005
Springer
13 years 10 months ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
EUROPAR
2004
Springer
13 years 10 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...