WADS
2007
Springer
13 years 10 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
PSIVT
2007
Springer
13 years 10 months ago
2007
Springer
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface E...
PDCAT
2007
Springer
13 years 10 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
HIPC
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
ICCV
2007
IEEE
13 years 11 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— A fundamental problem in quality-of-service (QoS) routing is to find a path connecting a source node to a destination node that satisfies K ≥ 2 additive QoS constraints. Th...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— In this paper, we evaluate a solution based on the preemption mechanism so as to improve performances of distributed Multi-Protocol Label Switching-Traffic Engineering (MPLS-T...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—Routing in wireless networks has been heavily studied in the last decade and numerous routing protocols were proposed in literature. The packets usually follow the short...
AINA
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper, we propose a map matching algorithm for car navigation systems that predict user destination. This car navigation system is a novel system that automatically predict...