616 search results - page 11 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
ICCNMC
2005
Springer
14 years 1 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, ...
ESA
1998
Springer
13 years 11 months ago
1998
Springer
WDAG
2001
Springer
13 years 12 months ago
2001
Springer
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
COCOC
1995
13 years 11 months ago
1995
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...
FSTTCS
2001
Springer
13 years 12 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...