Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs

被引：0
|
作者：
Telikepalli Kavitha
机构：
[1] Tata Institute of Fundamental Research,School of Technology and Computer Science
来源：
Algorithmica | 2012年 / 63卷
关键词：
Approximate distances; Combinatorial algorithm; Fast rectangular matrix multiplication;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Let G=(V,E) be a weighted undirected graph, with non-negative edge weights. We consider the problem of efficiently computing approximate distances between all pairs of vertices in G. While many efficient algorithms are known for this problem in unweighted graphs, not many results are known for this problem in weighted graphs.
引用
收藏
页码：224 / 245
页数：21
相关论文
共 50 条
  • [41] DYNAMIC APPROXIMATE ALL-PAIRS SHORTEST PATHS IN UNDIRECTED GRAPHS
    Roditty, Liam
    Zwick, Uri
    SIAM JOURNAL ON COMPUTING, 2012, 41 (03) : 670 - 683
  • [42] Efficient parameterized algorithms for computing all-pairs shortest paths
    Kratsch, Stefan
    Nelles, Florian
    DISCRETE APPLIED MATHEMATICS, 2023, 341 : 102 - 119
  • [43] Unified all-pairs shortest path algorithms in the chordal hierarchy
    Han, K
    Sekharan, CN
    Sridhar, R
    DISCRETE APPLIED MATHEMATICS, 1997, 77 (01) : 59 - 71
  • [44] Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths
    Kratsch, Stefan
    Nelles, Florian
    37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020), 2020, 154
  • [45] Communication Avoiding All-Pairs Shortest Paths Algorithm for Sparse Graphs
    Zhu, Lin
    Hua, Qiang-Sheng
    Jin, Hai
    50TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, 2021,
  • [46] A survey of the all-pairs shortest paths problem and its variants in graphs
    Reddy, K. R. Udaya Kumar
    ACTA UNIVERSITATIS SAPIENTIAE INFORMATICA, 2016, 8 (01) : 16 - 40
  • [47] All Pairs Shortest Paths in weighted directed graphs exact and almost exact algorithms
    Zwick, U
    39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 310 - 319
  • [48] An Algorithm for All-Pairs Regular Path Problem on External Memory Graphs
    Suzuki, Nobutaka
    Ikeda, Kosetsu
    Kwon, Yeondae
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2016, E99D (04) : 944 - 958
  • [49] Fast All-Pairs SimRank Assessment on Large Graphs and Bipartite Domains
    Yu, Weiren
    Lin, Xuemin
    Zhang, Wenjie
    McCann, Julie A.
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2015, 27 (07) : 1810 - 1823
  • [50] Massively parallel algorithms for fully dynamic all-pairs shortest paths
    Wang, Chilei
    Hua, Qiang-Sheng
    Jin, Hai
    Zheng, Chaodong
    FRONTIERS OF COMPUTER SCIENCE, 2024, 18 (04)
12345