A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Treewidth Computation and Kernelization in the Parallel External Memory Model
[chapter]

2014
*
Lecture Notes in Computer Science
*

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

doi:10.1007/978-3-662-44602-7_7
fatcat:tjzng5qyhbbmtmyc5c4chgqeue