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 条
  • [1] Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs
    Kavitha, Telikepalli
    ALGORITHMICA, 2012, 63 (1-2) : 224 - 245
  • [2] Faster algorithms for all-pairs small stretch distances in weighted graphs
    Kavitha, Telikepalli
    FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007, 4855 : 328 - 339
  • [3] Faster algorithms for approximate distance oracles and all-pairs small stretch paths
    Baswana, Surender
    Kavitha, Telikepalli
    47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2006, : 591 - +
  • [4] More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
    Chan, Timothy M.
    STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 590 - 598
  • [5] MORE ALGORITHMS FOR ALL-PAIRS SHORTEST PATHS IN WEIGHTED GRAPHS
    Chan, Timothy M.
    SIAM JOURNAL ON COMPUTING, 2010, 39 (05) : 2075 - 2089
  • [6] FASTER ALGORITHMS FOR ALL-PAIRS APPROXIMATE SHORTEST PATHS IN UNDIRECTED GRAPHS
    Baswana, Surender
    Kavitha, Telikepalli
    SIAM JOURNAL ON COMPUTING, 2010, 39 (07) : 2865 - 2896
  • [7] All-pairs small-stretch paths
    Cohen, E
    Zwick, U
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2001, 38 (02): : 335 - 353
  • [8] A faster all-pairs shortest path algorithm for real-weighted sparse graphs
    Pettie, S
    AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 85 - 97
  • [9] All-pairs small-stretch paths
    Cohen, E
    Zwick, U
    PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 93 - 102
  • [10] All-Pairs Bottleneck Paths in Vertex Weighted Graphs
    Shapira, Asaf
    Yuster, Raphael
    Zwick, Uri
    ALGORITHMICA, 2011, 59 (04) : 621 - 633
12345