Incremental optimization of independent sets under the reconfiguration framework

DOI10.1007/s10878-020-00630-zzbMath1495.90154OpenAlexW3082111916MaRDI QIDQ5918743

Akira Suzuki, Haruka Mizuta, Naomi Nishimura, Takehiro Ito

Publication date: 18 July 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00630-z

zbMATH Keywords

independent setgraph algorithmscombinatorial reconfiguration

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

Parameterized complexity of optimizing list vertex-coloring through reconfiguration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of independent set reconfigurability problems
• Fast local search for the maximum independent set problem
• On the parameterized complexity of reconfiguration problems
• On the complexity of reconfiguration problems
• Graph minors. I. Excluding a forest
• Token jumping in minor-closed classes
• Reconfiguration in bounded bandwidth and tree-depth
• Token sliding on chordal graphs
• A theory and algorithms for combinatorial reoptimization
• Reconfiguration on sparse graphs
• Introduction to reconfiguration
• The complexity of change
• Fixed-Parameter Tractability of Token Jumping on Planar Graphs
• Intersection Theorems for Systems of Sets
• Graph Classes: A Survey
• Sliding Tokens on a Cactus
• On the Parameterized Complexity for Token Jumping on Graphs
• k-Degenerate Graphs
• Incremental optimization of independent sets under the reconfiguration framework

This page was built for publication: Incremental optimization of independent sets under the reconfiguration framework