Low-Congestion Shortcuts for Graphs Excluding Dense Minors

7 August 2020

Papers citing "Low-Congestion Shortcuts for Graphs Excluding Dense Minors"

6 / 6 papers shown

Title
Low-Congestion Shortcut and Graph Parameters Naoki Kitamura Hirotaka Kitagawa Y. Otachi Taisuke Izumi 24 9 0 26 Aug 2019
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph Michal Dory M. Ghaffari 48 17 0 26 May 2019
New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms M. Ghaffari Jason Li 30 44 0 12 May 2018
Faster Distributed Shortest Path Approximations via Shortcuts Bernhard Haeupler Jason Li 14 36 0 11 Feb 2018
Minor Excluded Network Families Admit Fast Distributed Algorithms Bernhard Haeupler Jason Li Goran Zuzic 37 32 0 18 Jan 2018
Distributed Verification and Hardness of Distributed Approximation Atish Das Sarma S. Holzer Liah Kor Amos Korman Danupon Nanongkai Gopal Pandurangan David Peleg Roger Wattenhofer 67 344 0 12 Nov 2010