Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs

Open Webpage

Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman

Published: 2022, Last Modified: 29 Sept 2024SPAA 2022EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: 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 solutions in low-treewidth graphs.