P. Bonsma
Using contracted solution graphs for solving reconfiguration problems
Bonsma, P.; Paulusma, D.
Authors
Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor
Contributors
P. Faliszewski
Editor
A. Muscholl
Editor
R. Niedermeier
Editor
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.
Citation
Bonsma, P., & Paulusma, D. (2016). Using contracted solution graphs for solving reconfiguration problems. In P. Faliszewski, A. Muscholl, & R. Niedermeier (Eds.), 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22–26, 2016, Kraków, Poland. https://doi.org/10.4230/lipics.mfcs.2016.20
Conference Name | 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) |
---|---|
Conference Location | Krakow, Poland |
Start Date | Aug 22, 2016 |
End Date | Aug 26, 2016 |
Acceptance Date | Jun 5, 2016 |
Publication Date | Aug 1, 2016 |
Deposit Date | Oct 13, 2016 |
Publicly Available Date | Mar 29, 2024 |
Series Title | LIPIcs : Leibniz international proceedings in informatics |
Series Number | 58 |
Series ISSN | 1868-8969 |
Book Title | 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22–26, 2016, Kraków, Poland. |
DOI | https://doi.org/10.4230/lipics.mfcs.2016.20 |
Public URL | https://durham-repository.worktribe.com/output/1149794 |
Files
Published Conference Proceeding
(651 Kb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
Copyright Statement
© Paul Bonsma and Daniël Paulusma; licensed under Creative Commons License CC-BY
Accepted Conference Proceeding
(651 Kb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
You might also like
Matching cuts in graphs of high girth and H-free graphs
(2023)
Conference Proceeding
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
An algorithmic framework for locally constrained homomorphisms
(2023)
Journal Article
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
(2023)
Journal Article
Computing Subset Vertex Covers in H-Free Graphs
(2023)
Conference Proceeding
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search