License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2012.182
URN: urn:nbn:de:0030-drops-34032
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2012/3403/
Go to the corresponding LIPIcs Volume Portal

Kaminski, Marcin ; Thilikos, Dimitrios M.

Contraction checking in graphs on surfaces

pdf-format:
19.pdf (2 MB)

Abstract

The Contraction Checking problem asks, given two graphs H and G as input, whether H can be obtained from G by a sequence of edge contractions. Contraction Checking remains NP-complete, even when H is fixed. We show that this is not the case when G is embeddable in a surface of fixed Euler genus. In particular, we give an algorithm that solves Contraction Checking in f(h,g)*|V(G)|^3 steps, where h is the size of H and g is the Euler genus of the input graph G.

BibTeX - Entry

@InProceedings{kaminski_et_al:LIPIcs:2012:3403,
  author =	{Marcin Kaminski and Dimitrios M. Thilikos},
  title =	{{Contraction checking in graphs on surfaces}},
  booktitle =	{29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
  pages =	{182--193},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-35-4},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{14},
  editor =	{Christoph D{\"u}rr and Thomas Wilke},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3403},
  URN =		{urn:nbn:de:0030-drops-34032},
  doi =		{10.4230/LIPIcs.STACS.2012.182},
  annote =	{Keywords: Surfaces, Topological Minors, Contractions, Parameterized algorithms, Linkages }
}

Keywords: Surfaces, Topological Minors, Contractions, Parameterized algorithms, Linkages
Collection: 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
Issue Date: 2012
Date of publication: 24.02.2012

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