Parameterized complexity of reconfiguration of atoms

DOI10.1007/s00453-024-01262-zMaRDI QIDQ6623588

Stephanie Maaz, Alexandre Cooper, Naomi Nishimura, Amer E. Mouawad

Publication date: 24 October 2024

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

parameterized complexityquantum simulationcombinatorial reconfiguration

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of reconfiguration problems
• Reconfiguration of list edge-colorings in a graph
• Dominating sets reconfiguration under token sliding
• Recoloring graphs of treewidth 2
• Introduction to reconfiguration
• Connectedness of the graph of vertex-colourings
• Parametrized complexity theory.
• The complexity of change
• The Complexity of Independent Set Reconfiguration on Bipartite Graphs
• Parameterized Algorithms
• The steiner problem in graphs
• Reconfigurations in Graphs and Grids

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