Minor Excluded Network Families Admit Fast Distributed Algorithms

18 January 2018

Papers citing "Minor Excluded Network Families Admit Fast Distributed Algorithms"

7 / 7 papers shown

Title
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees Yi-Jun Chang 54 1 0 12 Nov 2023
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications Yi-Jun Chang 20 5 0 10 Apr 2023
$Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions$ Narrowing the LOCAL $\unicode{x2013}$ CONGEST Gaps in Sparse Networks via Expander Decompositions Yi-Jun Chang Hsin-Hao Su 34 10 0 17 May 2022
Local certification of graph decompositions and applications to minor-free classes Nicolas Bousquet Laurent Feuilloley Théo Pierron 13 22 0 30 Jul 2021
Low-Congestion Shortcuts in Constant Diameter Graphs Shimon Kogan M. Parter 16 11 0 03 Jun 2021
Property Testing of Planarity in the CONGEST model Reut Levi Moti Medina D. Ron 14 13 0 27 May 2018
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model Maleq Khan V. S. Anil Kumar Gopal Pandurangan Guanhong Pei 85 110 0 06 Jun 2012