Treewidth Computation and Kernelization in the Parallel External Memory Model

Riko Jacob, Tobias Lieber, Matthias Mnich

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review


We present a randomized algorithm which computes, for any fixed k, a tree decomposition of width at most k of any input graph. We analyze it in the parallel external memory (pem) model that measures efficiency by counting the number of cache misses on a multi-cpu private cache shared memory machine. Our algorithm has sorting complexity, which we prove to be optimal for a large parameter range. We use this algorithm as part of a pem-efficient kernelization algorithm. Kernelization is a technique for preprocessing instances of size n of np-hard problems with a structural parameter ? by compressing them efficiently to a kernel, an equivalent instance of size at most g(?). An optimal solution to the original instance can then be recovered efficiently from an optimal solution to the kernel. Our main results here is an adaption of the linear-time randomized protrusion replacement algorithm by fomin et al. (focs 2012). In particular, we obtain efficient randomized parallel algorithms to compute linear kernels in the pem model for all separable contraction-bidimensional problems with finite integer index (fii) on apex minor-free graphs, and for all treewidth-bounding graph problems with fii on topological minor-free graphs.
Original languageEnglish
Title of host publicationTheoretical Computer Science
Subtitle of host publication8th IFIP TC1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014 Proceedings
EditorsJosep Diaz, Ivan Lanese, Davide Sangiorgi
ISBN (Electronic)978-3-662-44602-7
ISBN (Print)978-3-662-44601-0
Publication statusPublished - 2014
Externally publishedYes

Publication series

SeriesLecture Notes in Computer Science

Cite this