334 search results - page 7 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
CCCG
2007
14 years 11 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
IFIP
2004
Springer
15 years 2 months ago
2004
Springer
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
JACM
2000
14 years 9 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
WEA
2007
Springer
15 years 3 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...
ICIP
2000
IEEE
15 years 11 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...