262 search results - page 7 / 53 » Image Registration with Minimum Spanning Tree Algorithm |
TALG
2008
14 years 9 months ago
2008
ICCNMC
2005
Springer
15 years 3 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
15 years 1 months ago
1998
Springer
WDAG
2001
Springer
15 years 2 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 ...
103
click to vote
FSTTCS
2001
Springer
15 years 2 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...