# Computing Tree Decompositions with FlowCutter: PACE 2017 Submission

arXiv: https://arxiv.org/abs/1709.08949 · HTML: https://mlsanity.com/paper/1709.08949/

## Key facts

- Cited by 7 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 26 Sep 2017.

## Built on by (most cited first, 7 of 7)

- [DPMS: An ADD-Based Symbolic Approach for Generalized MaxSAT Solving](https://mlsanity.com/paper/2205.03747/) (2022)
- [SharpSAT-TD in Model Counting Competitions 2021-2023](https://mlsanity.com/paper/2308.15819/) (2023)
- [Model Counting in the Wild](https://mlsanity.com/paper/2408.07059/) (2024)
- [DPO: Dynamic-Programming Optimization on Hybrid Constraints](https://mlsanity.com/paper/2205.08632/) (2022)
- [DPER: Dynamic Programming for Exist-Random Stochastic SAT](https://mlsanity.com/paper/2205.09826/) (2022)
- [Algorithmic algorithm development with LLMs: A Case Study on LLM-Usage for Contraction Order Optimization in Tensor Networks](https://mlsanity.com/paper/2606.01975/) (2026)
- [Learning to Rank Tensor Network Contraction Plans for GPU-Accelerated Quantum Circuit Simulation](https://mlsanity.com/paper/2608.05819/) (2026)

## Abstract (arXiv)

We describe the algorithm behind our PACE 2017 submission to the heuristic tree decomposition computation track. It was the only competitor to solve all instances and won a tight second place. The algorithm was originally developed in the context of accelerating shortest path computation on road graphs using multilevel partitions. We illustrate how this seemingly unrelated field fits into tree decomposition and parameterized complexity theory.