Parameterized complexity of reconfiguration of atoms

DOI10.1007/978-3-030-96731-4_22OpenAlexW3186338466MaRDI QIDQ2154105FDOQ2154105

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

• Parametrized complexity theory.
• Can you beat treewidth?
• Color-coding
• Parameterized algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Connectedness of the graph of vertex-colourings
• The complexity of change
• On the complexity of reconfiguration problems
• The steiner problem in graphs
• Reconfiguration of list edge-colorings in a graph
• Reconfigurations in Graphs and Grids
• Introduction to reconfiguration
• Title not available (Why is that?)
• The complexity of independent set reconfiguration on bipartite graphs
• Dominating sets reconfiguration under token sliding
• Recoloring graphs of treewidth 2

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)