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 条
  • [21] New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs
    Abboud, Amir
    Krauthgamer, Robert
    Trabelsi, Ohad
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 48 - 61
  • [22] Accelerating all-pairs shortest path algorithms for bipartite graphs on graphics processing units
    Muhammad Kashif Hanif
    Karl-Heinz Zimmermann
    Asad Anees
    Multimedia Tools and Applications, 2022, 81 : 9549 - 9566
  • [23] External memory algorithms for diameter and all-pairs shortest-paths on sparse graphs
    Arge, L
    Meyer, U
    Toma, L
    AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 146 - 157
  • [24] Algorithms for all-pairs reliable quickest paths
    Bang, YC
    Rao, NSV
    Radhakrishnan, S
    COMPUTATIONAL SCIENCE - ICCS 2003, PT II, PROCEEDINGS, 2003, 2658 : 678 - 684
  • [25] New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs
    Abboud, Amir
    Krauthgamer, Robert
    Trabelsi, Ohad
    THEORY OF COMPUTING, 2021, 17
  • [26] A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs
    Lingas, Andrzej
    Sledneu, Dzmitry
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, 7147 LNCS : 373 - 384
  • [27] A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs
    Lingas, Andrzej
    Sledneu, Dzmitry
    SOFSEM 2012: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2012, 7147 : 373 - +
  • [28] Faster All-Pairs Shortest Paths Via Circuit Complexity
    Williams, Ryan
    STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, : 664 - 673
  • [29] An all-pairs shortest path algorithm for bipartite graphs
    Torgasin, Svetlana
    Zimmermann, Karl-Heinz
    OPEN COMPUTER SCIENCE, 2013, 3 (04) : 149 - 157
  • [30] From Circuit Complexity to Faster All-Pairs Shortest Paths
    Williams, R. Ryan
    SIAM REVIEW, 2021, 63 (03) : 559 - 582
12345