Algorithms and Computation
From MaRDI portal
Publication:5897890
DOI10.1007/11602613zbMath1175.05100OpenAlexW2304246803MaRDI QIDQ5897890
Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov, Fedor V. Fomin
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
domatic numberminimum dominating setminimum set coverexact (exponential) algorithmsweighted dominating set
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 (12)
Counting dominating sets and related structures in graphs ⋮ Maximal and maximum dissociation sets in general and triangle-free graphs ⋮ An improved exact algorithm for the domatic number problem ⋮ Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG ⋮ Enumeration and maximum number of minimal connected vertex covers in graphs ⋮ Maximum dissociation sets in subcubic trees ⋮ Minimum number of maximal dissociation sets in trees ⋮ Trimmed Moebius inversion and graphs of bounded degree ⋮ On the maximum number of minimum dominating sets in forests ⋮ The parameterized complexity of maximality and minimality problems ⋮ On the minimum feedback vertex set problem: Exact and enumeration algorithms ⋮ On two techniques of combining branching and treewidth
This page was built for publication: Algorithms and Computation
