253 search results - page 30 / 51 » Faster Approximation of Distances in Graphs |
CIS
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. In this paper, we present a novel multi-stage algorithm for 3D medical image segmentation that is inspired by an improved Fast Marching method and a morphological reconst...
SWAT
2010
Springer
13 years 5 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
SEMWEB
2007
Springer
14 years 1 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
SIROCCO
2010
13 years 8 months ago
2010
Abstract. This paper concerns graph spanners that approximate multipaths between pair of vertices of an undirected graphs with n vertices. Classically, a spanner H of stretch s for...
JDA
2007
13 years 7 months ago
2007
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...