Fast Parallel Fixed-parameter Algorithms via Color Coding

Max Bannach, Christoph Stockhusen, Till Tantau


Fixed-parameter algorithms have been successfully applied to solve numerous difficult problems within acceptable time bounds on large inputs. However, most fixed-parameter algorithms are inherently sequential and, thus, make no use of the parallel hardware present in modern computers. We show that parallel fixed-parameter algorithms do not only exist for numerous parameterized problems from the literature - including vertex cover, packing problems, cluster editing, cutting vertices, finding embeddings, or finding matchings - but that there are parallel algorithms working in constant time or at least in time depending only on the parameter (and not on the size of the input) for these problems. Phrased in terms of complexity classes, we place numerous natural parameterized problems in parameterized versions of AC^0. On a more technical level, we show how the color coding method can be implemented in constant time and apply it to embedding problems for graphs of bounded tree-width or tree-depth and to model checking first-order formulas in graphs of bounded degree.
Titel10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
Redakteure/-innenThore Husfeldt, Iyad Kanj
ErscheinungsortDagstuhl, Germany
Herausgeber (Verlag)Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
ISBN (Print)978-3-939897-92-7
PublikationsstatusVeröffentlicht - 23.09.2015
Veranstaltung10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
- Patras, Griechenland
Dauer: 16.09.201518.09.2015


Untersuchen Sie die Forschungsthemen von „Fast Parallel Fixed-parameter Algorithms via Color Coding“. Zusammen bilden sie einen einzigartigen Fingerprint.