Linear transformations between dominating sets in the TAR-model

DOI10.4230/lipics.isaac.2020.37arXiv2006.16726OpenAlexW3117924141MaRDI QIDQ6087209

Alice Joffard, Nicolas Bousquet, Paul Ouvrard

Publication date: 14 November 2023

Full work available at URL: https://arxiv.org/abs/2006.16726

zbMATH Keywords

minordiametertreewidthconnectivitydominating setsreconfigurationaddition removal

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

TS-reconfiguration of dominating sets in circle and circular-arc graphs ⋮ Reconfiguration graphs for dominating sets

Cites Work

• Reconfiguration of dominating sets
• The complexity of dominating set reconfiguration
• On the parameterized complexity of reconfiguration problems
• On the complexity of reconfiguration problems
• Connected \(k\)-dominating graphs
• Reconfiguration on sparse graphs
• The \(k\)-dominating graph
• Introduction to reconfiguration
• Reconfiguring dominating sets in some well-covered and other classes of graphs
• Homomorphiesätze für Graphen
• The complexity of change
• An extremal function for contractions of graphs
• Decremental Optimization of Dominating Sets Under the Reconfiguration Framework
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Incremental optimization of independent sets under the reconfiguration framework
• Unnamed Item

This page was built for publication: Linear transformations between dominating sets in the TAR-model