396 search results - page 9 / 80 » An Optimal Minimum Spanning Tree Algorithm |
103
click to vote
SRDS
1998
IEEE
15 years 3 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...
ICIP
2000
IEEE
16 years 1 months ago
2000
IEEE
Registration is a fundamental task in image processing and quite a few registration techniques have been developed in various fields. In this paper we propose a novel graphreprese...
114
click to vote
OPODIS
2001
15 years 1 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...
107
click to vote
WDAG
2007
Springer
15 years 5 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...
STOC
2000
ACM
15 years 4 months ago
2000
ACM
