Brief Announcement: Distributed Single-Source Reachability

被引：10
|
作者：
Ghaffari, Mohsen [1 ]
Udwani, Rajan [1 ]
机构：
[1] MIT, Cambridge, MA 02139 USA
来源：
PODC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING | 2015年
关键词：
Distributed Algorithm; Reachability; Directed Graphs;
D O I：
10.1145/2767386.2767444
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In the directed single-source reachability problem, input is a directed graph G = (V,E) and a source s is an element of V, and the objective is to identify nodes t for which there is a directed path in G from s to t. Recently Nanongkai [2] presented a distributed algorithm that solves this problem in (O) over tilde (D + root nD(1/2)) rounds, where D and n respectively denote the network diameter and the number of nodes. This note presents an algorithm that improves the round complexity to (O) over tilde (D + root nD(1/4)), thus getting closer to the (Omega) over tilde (D + root n) lower bound of Das Sarma et al. [1].
引用
收藏
页码：163 / 165
页数：3
相关论文
共 50 条
  • [1] Brief Announcement: An Improved Distributed Approximate Single-Source Shortest Paths Algorithm
    Cao, Nairen
    Fineman, Jeremy T.
    Russell, Katina
    PROCEEDINGS OF THE 2021 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '21), 2021, : 493 - 496
  • [2] Decremental Single-Source Reachability in Planar Digraphs
    Italiano, Giuseppe F.
    Karczmarz, Adam
    Lacki, Jakub
    Sankowski, Piotr
    STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 1108 - 1121
  • [3] Brief Announcement: Improved Work Span Tradeoff for Single Source Reachability and Approximate Shortest Paths
    Cao, Nairen
    Fineman, Jeremy T.
    Russell, Katina
    PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 511 - 513
  • [4] Fully Dynamic Single-Source Reachability in Practice: An Experimental Study
    Hanauer, Kathrin
    Henzinger, Monika
    Schulz, Christian
    2020 PROCEEDINGS OF THE SYMPOSIUM ON ALGORITHM ENGINEERING AND EXPERIMENTS, ALENEX, 2020, : 106 - 119
  • [5] Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
    Henzinger, Monika
    Krinninger, Sebastian
    Nanongkai, Danupon
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 725 - 736
  • [6] FAULT-TOLERANT SUBGRAPH FOR SINGLE-SOURCE REACHABILITY: GENERAL AND OPTIMAL
    Baswana, Surender
    Choudhary, Keerti
    Roditty, Liam
    SIAM JOURNAL ON COMPUTING, 2018, 47 (01) : 80 - 95
  • [7] ASSOCIATIVE VERSION OF THE RAMALINGAM INCREMENTAL ALGORITHM FOR THE DYNAMIC SINGLE-SOURCE REACHABILITY PROBLEM
    Nepomniaschaya, A. Sh
    Snytnikova, T., V
    VESTNIK TOMSKOGO GOSUDARSTVENNOGO UNIVERSITETA-UPRAVLENIE VYCHISLITELNAJA TEHNIKA I INFORMATIKA-TOMSK STATE UNIVERSITY JOURNAL OF CONTROL AND COMPUTER SCIENCE, 2021, (54): : 86 - 96
  • [8] A Faster Distributed Single-Source Shortest Paths Algorithm
    Forster, Sebastian
    Nanongkai, Danupon
    2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2018, : 686 - 697
  • [9] DECREMENTAL STRONGLY CONNECTED COMPONENTS AND SINGLE-SOURCE REACHABILITY IN NEAR-LINEAR TIME
    Bernstein, Aaron
    Gutenberg, Maximilian Probst
    Wulff-Nilsen, Christian
    SIAM JOURNAL ON COMPUTING, 2023, 52 (02) : 128 - 155
  • [10] DISK: A Distributed Framework for Single-Source SimRank with Accuracy Guarantee
    Wang, Yue
    Xu, Ruiqi
    Feng, Zonghao
    Che, Yulin
    Chen, Lei
    Luo, Qiong
    Mao, Rui
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2020, 14 (03): : 351 - 363
12345