Sciweavers

Share
ICDCS
2012
IEEE
7 years 3 months ago
Optimal Recovery from Large-Scale Failures in IP Networks
—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 ...
Qiang Zheng, Guohong Cao, Tom La Porta, Ananthram ...
VLDB
2012
ACM
361views Database» more  VLDB 2012»
7 years 9 months ago
Answering pattern match queries in large graph databases via graph embedding
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
8 years 8 months ago
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
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...
Timothy M. Chan
OL
2011
277views Neural Networks» more  OL 2011»
8 years 8 months ago
An exact algorithm for minimum CDS with shortest path constraint in wireless networks
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...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
CORR
2011
Springer
184views Education» more  CORR 2011»
8 years 8 months ago
Finding Shortest Path for Developed Cognitive Map Using Medial Axis
— 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...
Hazim A. Farhan, Hussein H. Owaied, Suhaib I. Al-G...
CORR
2010
Springer
180views Education» more  CORR 2010»
8 years 11 months ago
Shortest path problem in rectangular complexes of global nonpositive curvature
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...
Victor Chepoi, Daniela Maftuleac
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
8 years 11 months ago
The asymmetric sinistral/dextral Markov-Dubins problem
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...
Efstathios Bakolas, Panagiotis Tsiotras
WALCOM
2010
IEEE
260views Algorithms» more  WALCOM 2010»
8 years 12 months ago
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
We present two space-efficient 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 ...
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang
SIAMCOMP
2010
133views more  SIAMCOMP 2010»
8 years 12 months ago
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
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...
Surender Baswana, Telikepalli Kavitha
PVLDB
2010
146views more  PVLDB 2010»
8 years 12 months ago
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions
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...
Michael Rice, Vassilis J. Tsotras
books