Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs-Reference-Cited by-同舟云学术

Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs

Published:2022-07-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Izumi Taisuke¹,Kitamura Naoki¹,Naruse Takamasa²,Schwartzman Gregory³

Affiliation:

1. Osaka University, Osaka, Japan

2. Nagoya Institute of Technology, Aichi, Japan

3. Japan Advanced Institute of Science and Technology, Ishikawa, Japan

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3490148.3538590

Reference50 articles.

1. Amir Abboud , Keren Censor-Hillel , and Seri Khoury . 2016 . Near-Linear Lower Bounds for Distributed Distance Computations , Even in Sparse Networks. In 30th International Symposium on Distributed Computing (DISC). 29--42 . Amir Abboud, Keren Censor-Hillel, and Seri Khoury. 2016. Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks. In 30th International Symposium on Distributed Computing (DISC). 29--42.

2. A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds

3. Mohamad Ahmadi and Fabian Kuhn . 2020 . Distributed maximum matching verification in CONGEST . In 34th International Symposium on Distributed Computing (DISC). 37:1--37:18 . https://doi.org/10.4230/LIPIcs.DISC.2020.37 10.4230/LIPIcs.DISC.2020.37 Mohamad Ahmadi and Fabian Kuhn. 2020. Distributed maximum matching verification in CONGEST. In 34th International Symposium on Distributed Computing (DISC). 37:1--37:18. https://doi.org/10.4230/LIPIcs.DISC.2020.37

4. Mohamad Ahmadi , Fabian Kuhn , and Rotem Oshman . 2018 . Distributed approximate maximum matching in the congest model . In Proceedings of the 32rd International Symposium on Distributed Computing (DISC). 6:1--6:17 . https: //doi.org/10.4230/LIPIcs.DISC.2018.6 10.4230/LIPIcs.DISC.2018.6 Mohamad Ahmadi, Fabian Kuhn, and Rotem Oshman. 2018. Distributed approximate maximum matching in the congest model. In Proceedings of the 32rd International Symposium on Distributed Computing (DISC). 6:1--6:17. https: //doi.org/10.4230/LIPIcs.DISC.2018.6

5. Hardness of Distributed Optimization

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Bounded Pathwidth of Control-Flow Graphs;Proceedings of the ACM on Programming Languages;2023-10-16