License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.IPEC.2015.224
URN: urn:nbn:de:0030-drops-55857
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5585/
Go to the corresponding LIPIcs Volume Portal

Bannach, Max ; Stockhusen, Christoph ; Tantau, Till

Fast Parallel Fixed-parameter Algorithms via Color Coding

pdf-format:
22.pdf (0.5 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{bannach_et_al:LIPIcs:2015:5585,
  author =	{Max Bannach and Christoph Stockhusen and Till Tantau},
  title =	{{Fast Parallel Fixed-parameter Algorithms via Color Coding}},
  booktitle =	{10th International Symposium on Parameterized and Exact Computation (IPEC 2015)},
  pages =	{224--235},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-92-7},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{43},
  editor =	{Thore Husfeldt and Iyad Kanj},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5585},
  URN =		{urn:nbn:de:0030-drops-55857},
  doi =		{10.4230/LIPIcs.IPEC.2015.224},
  annote =	{Keywords: color coding, parallel computation, fixed-parameter   tractability, graph packing, cutting $ell$ vertices, cluster   editing, tree-width, tree-depth, }
}

Keywords: color coding, parallel computation, fixed-parameter tractability, graph packing, cutting $ell$ vertices, cluster editing, tree-width, tree-depth,
Collection: 10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
Issue Date: 2015
Date of publication: 19.11.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI