scientific article; zbMATH DE number 6850321

zbMath1403.68169MaRDI QIDQ4607889

Amer E. Mouawad, Daniel Lokshtanov

Publication date: 15 March 2018

Full work available at URL: http://dl.acm.org/citation.cfm?id=3175279

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (17)

TS-reconfiguration of dominating sets in circle and circular-arc graphs ⋮ Reconfiguration of colorable sets in classes of perfect graphs ⋮ Complexity of Hamiltonian cycle reconfiguration ⋮ Reconfiguration on nowhere dense graph classes ⋮ Shortest reconfiguration of sliding tokens on subclasses of interval graphs ⋮ Distributed reconfiguration of maximal independent sets ⋮ Parameterized complexity of independent set reconfiguration problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Dominating sets reconfiguration under token sliding ⋮ Independent-set reconfiguration thresholds of hereditary graph classes ⋮ Incremental optimization of independent sets under the reconfiguration framework ⋮ Independent set reconfiguration parameterized by modular-width ⋮ Token sliding on split graphs ⋮ Distributed Reconfiguration of Maximal Independent Sets ⋮ Reconfiguration of Colorable Sets in Classes of Perfect Graphs ⋮ Introduction to reconfiguration

This page was built for publication: