Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs

Taisuke Izumi, Naoki Kitamura, Takamasa Naruse +1

We consider global problems, i.e. problems that take at least diameter time, even when the bandwidth is not restricted. We show that all problems considered admit efficient solutio…