Reasons to fall (more) in love with combinatorial reconfiguration

DOI10.1007/978-981-97-0566-5_2MaRDI QIDQ6575375FDOQ6575375

Authors N. Nishimura

Publication date 19 July 2024

zbMATH Keywords

algorithmscombinatorial reconfiguration

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 7272506 (Why is no real title available?)
• Correction to: ``On reconfiguration graphs of independent sets under token sliding
• Gap preserving reductions between reconfiguration problems
• Incremental optimization of independent sets under the reconfiguration framework
• Introduction to reconfiguration
• Note on the ``15 puzzle.
• On the complexity of reconfiguration problems
• On the structure of dominating graphs
• Parameterized complexity of reconfiguration of atoms
• Reconfiguration of connected graph partitions via recombination
• Reconfiguration of graph minors
• The \(k\)-dominating graph
• The complexity of change

This page was built for publication: Reasons to fall (more) in love with combinatorial reconfiguration

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