Independent Set Reconfiguration Parameterized by Modular-Width
Open Access
- 24 March 2020
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 82 (9) , 2586-2605
Abstract
No abstract availableKeywords
Funding Information
- JSPS and MAEDI (GRAPA 38593YJ)
- Japan Society for the Promotion of Science (JP24106004, JP17H01698, JP18K11157, JP18K11168, JP18K11169, JP18H04091, JP18H06469)
This publication has 23 references indexed in Scilit:
- Token Sliding on Chordal Graphs2017
- Token Jumping in Minor-Closed Classes2017
- Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal CliquesAlgorithmica, 2017
- Sliding Token on Bipartite Permutation GraphsLecture Notes in Computer Science, 2015
- Independent Set Reconfiguration in Cographs and their GeneralizationsJournal of Graph Theory, 2015
- Linear-time algorithm for sliding tokens on treesTheoretical Computer Science, 2015
- Parameterized Algorithms2015
- Reconfiguring Independent Sets in Claw-Free GraphsLecture Notes in Computer Science, 2014
- Parameterized Algorithms for Modular-Width2013
- A new linear algorithm for Modular Decomposition2005