Distributed Treewidth Computation and Courcelle's Theorem in the CONGEST Model

Algorithmic meta-theorems, stating that graph properties expressible in some particular logic can be decided efficiently in graph classes having some specific structural properties, are now standard in sequential graph algorithms. One of the most classic examples is Courcelle's theorem: all properties expressible in Monadic Second-Order logic (MSO) are decidable in linear time in graphs of bounded treewidth.We provide here a distributed version of Courcelle's theorem, in the standard CONGEST model for distributed computing: For any MSO formula φ and any constant k, there is a CONGEST algorithm that, given an input communication network G of treewidth at most k and of diameter D, decides if G satisfies property φ in Õ(D) rounds. Simple examples show that the dependency on D is unavoidable. Also, if we drop the assumption of bounded treewidth, deciding MSO properties such as 3-colorability are known to require ω∼(n2) rounds in the CONGEST model. Our results extend to optimization problems (e.g., computing a maximum size independent set, or a minimum dominating set) and counting (e.g. triangle counting). As usual, the Õ notation hides polylogarithmic factors in n; here it also hides a constant factor depending on k and on the MSO formula φ.We also give a distributed algorithm producing a linear approximation for treewidth: For any k, it decides that the treewidth of the input network G is larger than k or computes a tree decomposition of width O(k) and depth O(log n), in Õ(kO(k) D) rounds in CONGEST.Our algorithms make use of the low-congestion shortcuts framework introduced by Ghaffari and Haeupler [SODA 2016], and our main technical tool is an Õ(k4D) algorithm for computing (s, t)-separators of size at most k + 1 in graphs of treewidth at most k.