License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2016.20
URN: urn:nbn:de:0030-drops-64351
URL: http://drops.dagstuhl.de/opus/volltexte/2016/6435/
Go to the corresponding LIPIcs Volume Portal


Bonsma, Paul ; Paulusma, DaniŽl

Using Contracted Solution Graphs for Solving Reconfiguration Problems

pdf-format:
LIPIcs-MFCS-2016-20.pdf (0.6 MB)


Abstract

We introduce a dynamic programming method for solving reconfiguration problems, based on contracted solution graphs, which are obtained from solution graphs by performing an appropriate series of edge contractions that decrease the graph size without losing any critical information needed to solve the reconfiguration problem under consideration. As an example, we consider a well-studied problem: given two k-colorings alpha and beta of a graph G, can alpha be modified into beta by recoloring one vertex of G at a time, while maintaining a k-coloring throughout? By applying our method in combination with a thorough exploitation of the graph structure we obtain a polynomial-time algorithm for (k-2)-connected chordal graphs.

BibTeX - Entry

@InProceedings{bonsma_et_al:LIPIcs:2016:6435,
  author =	{Paul Bonsma and Dani{\"e}l Paulusma},
  title =	{{Using Contracted Solution Graphs for Solving Reconfiguration Problems}},
  booktitle =	{41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
  pages =	{20:1--20:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-016-3},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{58},
  editor =	{Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6435},
  URN =		{urn:nbn:de:0030-drops-64351},
  doi =		{10.4230/LIPIcs.MFCS.2016.20},
  annote =	{Keywords: reconfiguration, contraction, dynamic programming, graph coloring}
}

Keywords: reconfiguration, contraction, dynamic programming, graph coloring
Seminar: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Issue Date: 2016
Date of publication: 19.08.2016


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