Editorial: Special issue on reconfiguration problems

DOI10.3390/A11110187zbMath1461.68003DBLPjournals/algorithms/Abu-KhzamFU18OpenAlexW2901980660WikidataQ59864846 ScholiaQ59864846MaRDI QIDQ1712044

No author found.

Publication date: 21 January 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a11110187

zbMATH Keywords

computational complexityreconfiguration problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs
• Introduction to reconfiguration
• Complexity of Hamiltonian cycle reconfiguration
• Vertex Cover Reconfiguration and Beyond

This page was built for publication: Editorial: Special issue on reconfiguration problems