SP2: spanner construction for shortest path computation on streaming graph
Abstract
References
Index Terms
- SP2: spanner construction for shortest path computation on streaming graph
Recommendations
Fully dynamic randomized algorithms for graph spanners
Spanner of an undirected graph G = (V,E) is a subgraph that is sparse and yet preserves all-pairs distances approximately. More formally, a spanner with stretch t ∈ ℕ is a subgraph (V,ES), ES ⊆ E such that the distance between any two vertices in the ...
Approximate Shortest Paths Guided by a Small Index
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the original graph in addition to the graph excerpt while computing paths. This ...
Partially dynamic efficient algorithms for distributed shortest paths
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work under the assumption that before dealing with an edge operation, the algorithm for the ...
Comments
Information & Contributors
Information
Published In
- General Chairs:
- Jinho Kim,
- Young-Kuk Kim,
- James Geller,
- Program Chairs:
- Wonik Choi,
- Carson K. Leung,
- Young-Ho Park
Sponsors
- KoDB: Korea Database Agency
- Nara System: Nara System
- 2e consulting: 2e consulting
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
- KoDB
- Nara System
- 2e consulting
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 85Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in