209 search results - page 5 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
CORR
2008
Springer
14 years 9 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...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
CN
2008
14 years 9 months ago
2008
74
Voted
ICCNMC
2005
Springer
15 years 2 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, ...