ICDCS

2012

IEEE

11 years 9 months ago
2012

IEEE

—Quickly recovering IP networks from failures is critical to enhancing Internet robustness and availability. Due to their serious impact on network routing, large-scale failures ...

VLDB

2012

ACM

12 years 2 months ago
2012

ACM

The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability veriﬁcation, and pattern ...

SIAMCOMP

2010

13 years 1 months ago
2010

In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...

OL

2011

13 years 2 months ago
2011

In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...

CORR

2011

Springer

13 years 2 months ago
2011

Springer

— this paper presents an enhancement of the medial axis algorithm to be used for finding the optimal shortest path for developed cognitive map. The cognitive map has been develop...

CORR

2010

Springer

13 years 4 months ago
2010

Springer

Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...

CDC

2009

IEEE

13 years 5 months ago
2009

IEEE

Abstract-- We consider a variation of the classical MarkovDubins problem dealing with curvature-constrained, shortest paths in the plane with prescribed initial and terminal positi...

WALCOM

2010

IEEE

13 years 5 months ago
2010

IEEE

We present two space-eﬃcient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...

SIAMCOMP

2010

13 years 5 months ago
2010

Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...

PVLDB

2010

13 years 5 months ago
2010

The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...