Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
Yi‐Jun Chang · 2023
In the LOCAL model of distributed computing, low-diameter decomposition is an extremely useful tool in designing algorithms, as it allows us to shift from the general graph setting to the low-diameter graph setting, where brute-force information gathering can be done efficiently.