262 search results - page 5 / 53 » Image Registration with Minimum Spanning Tree Algorithm |
156
click to vote
SRDS
1998
IEEE
15 years 10 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
140
click to vote
WEA
2007
Springer
15 years 12 months ago
2007
Springer
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
179
Voted
OPODIS
2001
15 years 7 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...
167
click to vote
WDAG
2007
Springer
15 years 12 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
