Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs

被引：0

作者：

Surender Baswana

Neelesh Khanna

机构：

[1] IIT Kanpur,Department of Computer Science and Engineering

[2] Oracle India Pvt. Ltd.,undefined

来源：

Algorithmica | 2013年 / 66卷

关键词：

Shortest path; Distance; Approximate distance; Oracle;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Let G=(V,E) be an undirected unweighted graph. A path between any two vertices u,v∈V is said to be t-approximate shortest path if its length is at most t times the length of the shortest path between u and v. We address the problem of building a compact data structure which can efficiently answer the following query for any u,v,x∈V and t>1: Reportt-approximate shortest path betweenuandvwhen vertexxfails.

引用

页码：18 / 50

页数：32

共 18 条

[1] Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs
Baswana, Surender
Khanna, Neelesh
ALGORITHMICA, 2013, 66 (01) : 18 - 50
[2] APPROXIMATE SHORTEST PATHS AVOIDING A FAILED VERTEX : OPTIMAL SIZE DATA STRUCTURES FOR UNWEIGHTED GRAPHS
Khanna, Neelesh
Baswana, Surender
27TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2010), 2010, 5 : 513 - 524
[3] Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
Balzotti, Lorenzo
Franciosa, Paolo G.
Journal of Graph Algorithms and Applications, 2022, 26 (04) : 589 - 606
[4] All-Pairs Shortest Paths for Unweighted Undirected Graphs in o(mn) Time
Chan, Timothy M.
PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 514 - 523
[5] All-Pairs Shortest Paths for Unweighted Undirected Graphs in o(mn) Time
Chan, Timothy M.
ACM TRANSACTIONS ON ALGORITHMS, 2012, 8 (04)
[6] Dynamic approximate all-pairs shortest paths in undirected graphs
Roditty, L
Zwick, U
45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, : 499 - 508
[7] DYNAMIC APPROXIMATE ALL-PAIRS SHORTEST PATHS IN UNDIRECTED GRAPHS
Roditty, Liam
Zwick, Uri
SIAM JOURNAL ON COMPUTING, 2012, 41 (03) : 670 - 683
[8] FASTER ALGORITHMS FOR ALL-PAIRS APPROXIMATE SHORTEST PATHS IN UNDIRECTED GRAPHS
Baswana, Surender
Kavitha, Telikepalli
SIAM JOURNAL ON COMPUTING, 2010, 39 (07) : 2865 - 2896
[9] Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs
Borradaile, Glencora
Nayyeri, Amir
Zafarani, Farzad
ALGORITHMS - ESA 2015, 2015, 9294 : 227 - 238
[10] External-Memory Exact and Approximate All-Pairs Shortest-Paths in Undirected Graphs
Chowdhury, Rezaul Alam
Ramachandran, Vijaya
PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 735 - 744

← 1 2 →