A Dichotomy for Upper Domination in Monogenic Classes
From MaRDI portal
Publication:2942401
DOI10.1007/978-3-319-12691-3_20zbMath1391.05240OpenAlexW90107675MaRDI QIDQ2942401
Bernard Ries, Jérôme Monnot, Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin
Publication date: 11 September 2015
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10754/563271
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (9)
A complexity dichotomy and a new boundary class for the dominating set problem ⋮ Boundary classes for graph problems involving non-local properties ⋮ Weighted upper domination number ⋮ The many facets of upper domination ⋮ Critical hereditary graph classes: a survey ⋮ Upper domination: towards a dichotomy through boundary properties ⋮ Algorithmic aspects of upper edge domination ⋮ A Boundary Property for Upper Domination ⋮ Upper Domination: Complexity and Approximation
This page was built for publication: A Dichotomy for Upper Domination in Monogenic Classes
