All pairs almost shortest paths

被引：18
|
作者：
Dor, D [1 ]
Halperin, S [1 ]
Zwick, U [1 ]
机构：
[1] TEL AVIV UNIV,DEPT COMP SCI,IL-69978 TEL AVIV,ISRAEL
来源：
37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS | 1996年
关键词：
D O I：
10.1109/SFCS.1996.548504
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：452 / 461
页数：10
相关论文
共 50 条
  • [41] Computing all-pairs shortest paths by leveraging low treewidth
    Planken, Leon
    Weerdt, Mathijs De
    Krogt, Roman Van Der
    Planken, L. (l.r.planken@tudelft.nl), 1600, AI Access Foundation (43): : 353 - 388
  • [42] 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
  • [43] All-pairs shortest paths algorithm for highdimensional sparse graphs
    Urakov, A. R.
    Timeryaev, T., V
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2013, 19 (01): : 84 - 92
  • [44] FASTER ALL-PAIRS SHORTEST PATHS VIA CIRCUIT COMPLEXITY
    Williams, R. Ryan
    SIAM JOURNAL ON COMPUTING, 2018, 47 (05) : 1965 - 1985
  • [45] Computing All-Pairs Shortest Paths by Leveraging Low Treewidth
    Planken, Leon
    de Weerdt, Mathijs
    van der Krogt, Roman
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2012, 43 : 353 - 388
  • [46] DYNAMIC APPROXIMATE ALL-PAIRS SHORTEST PATHS IN UNDIRECTED GRAPHS
    Roditty, Liam
    Zwick, Uri
    SIAM JOURNAL ON COMPUTING, 2012, 41 (03) : 670 - 683
  • [47] On the comparison-addition complexity of all-pairs shortest paths
    Pettie, S
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 32 - 43
  • [48] A symbolic approach to the all-pairs shortest-paths problem
    Sawitzki, D
    GRAPH -THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2004, 3353 : 154 - 167
  • [49] 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
  • [50] Fully dynamic all pairs shortest paths with real edge weights
    Demetrescu, C
    Italiano, GF
    42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 260 - 267
12345