Reasons to fall (more) in love with combinatorial reconfiguration
From MaRDI portal
Publication:6575375
DOI10.1007/978-981-97-0566-5_2MaRDI QIDQ6575375FDOQ6575375
Authors: N. Nishimura 
Publication date: 19 July 2024
Cites Work
- The \(k\)-dominating graph
- The complexity of change
- On the complexity of reconfiguration problems
- Introduction to reconfiguration
- Note on the ``15 puzzle.
- Reconfiguration of connected graph partitions via recombination
- Title not available (Why is that?)
- On the structure of dominating graphs
- Parameterized complexity of reconfiguration of atoms
- Reconfiguration of graph minors
- Incremental optimization of independent sets under the reconfiguration framework
- Correction to: ``On reconfiguration graphs of independent sets under token sliding
- Gap preserving reductions between reconfiguration problems
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)
