Independent Set Reconfiguration in Cographs
From MaRDI portal
Publication:2945182
DOI10.1007/978-3-319-12340-0_9zbMath1417.05149arXiv1402.1587OpenAlexW1604387437MaRDI QIDQ2945182
Publication date: 9 September 2015
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.1587
Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
Finding shortest paths between graph colourings ⋮ Reconfiguration of dominating sets ⋮ Linear-time algorithm for sliding tokens on trees ⋮ The complexity of dominating set reconfiguration ⋮ Independent-set reconfiguration thresholds of hereditary graph classes
This page was built for publication: Independent Set Reconfiguration in Cographs
