DeepAI AI Chat
Log In Sign Up

Distributed Treewidth Computation

by   Jason Li, et al.

Of all the restricted graph families out there, the family of low treewidth graphs has continuously proven to admit many algorithmic applications. For example, many NP-hard algorithms can be solved in polynomial time on graphs of constant treewidth. Other algorithmic techniques, such as Baker's technique, partition the graph into components of low treewidth. Therefore, computing the treewidth of a graph remains an important problem in algorithm design. For graphs of constant treewidth, linear-time algorithms are known in the classical setting, and well as polylog(n)-time parallel algorithms for computing an O(1)-approximation to treewidth. However, nothing is yet known in the distributed setting. In this paper, we give near-optimal algorithms for computing the treewidth on a distributed network. We show that for graphs of constant treewidth, an O(1)-approximation to the treewidth can be computed in near-optimal Õ(D) time, where D is the diameter of the network graph. In addition, we show that many NP-hard problems that are tractable on constant treewidth graphs can also be solved in Õ(D) time on a distributed network of constant treewidth. Our algorithms make use of the shortcuts framework of Ghaffari and Haeupler [SODA'16], which has proven to be a powerful tool in designing near-optimal distributed algorithms for restricted graph networks, such as planar graphs, low-treewidth graphs, and excluded minor graphs.


page 6

page 9


Hardness of Metric Dimension in Graphs of Constant Treewidth

The Metric Dimension problem asks for a minimum-sized resolving set in a...

The Leafed Induced Subtree in chordal and bounded treewidth graphs

In the Fully Leafed Induced Subtrees, one is given a graph G and two int...

Four short stories on surprising algorithmic uses of treewidth

This article briefly describes four algorithmic problems where the notio...

On the complexity of embedding in graph products

Graph embedding, especially as a subgraph of a grid, is an old topic in ...

Finding and Counting Patterns in Sparse Graphs

We consider algorithms for finding and counting small, fixed graphs in s...

Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs

We consider global problems, i.e. problems that take at least diameter t...

The Distribution Function of the Longest Path Length in Constant Treewidth DAGs with Random Edge Length

This paper is about the length X_ MAX of the longest path in directed ac...