52 search results - page 5 / 11 » Testing Euclidean minimum spanning trees in the plane |
174
click to vote
FSTTCS
2007
Springer
16 years 23 days ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
179
click to vote
ASPDAC
2001
ACM
15 years 10 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
170
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
157
click to vote
ICIP
2000
IEEE
16 years 8 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...
167
click to vote
ICALP
2005
Springer
16 years 3 days ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...