Parameterized complexity of reconfiguration of atoms

DOI10.1007/978-3-030-96731-4_22MaRDI QIDQ2154105zbMATH OpenOpenAlexFDO

Authors Alexandre Cooper, Stephanie Maaz, Amer E. Mouawad, N. Nishimura

Publication date 13 July 2022

Full work available at URL https://arxiv.org/abs/2107.12267

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 139776 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Can you beat treewidth?
• Color-coding
• Connectedness of the graph of vertex-colourings
• Dominating sets reconfiguration under token sliding
• Introduction to reconfiguration
• On the complexity of reconfiguration problems
• Parameterized algorithms
• Parametrized complexity theory.
• Recoloring graphs of treewidth 2
• Reconfiguration of list edge-colorings in a graph
• Reconfigurations in Graphs and Grids
• The complexity of change
• The complexity of independent set reconfiguration on bipartite graphs
• The steiner problem in graphs

Cited in

(3)

• Reasons to fall (more) in love with combinatorial reconfiguration
• The Max-Atom Problem and Its Relevance
• Complexity of atoms, combinatorially

This page was built for publication: Parameterized complexity of reconfiguration of atoms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154105)