Approximation algorithms for double domination number of graphs
From MaRDI portal
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Cites work
- \(k\)-tuple domination in graphs
- A better approximation ratio for the vertex cover problem
- A disproof of Henning's conjecture on irredundance perfect graphs
- A linear algorithm for the domination number of a tree
- Algorithmic aspect of k-tuple domination in graphs.
- Dominating sets for split and bipartite graphs
- Dominating Sets in Chordal Graphs
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Fast algorithms for the dominating set problem on permutation graphs
- Graph theory
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1792607 (Why is no real title available?)
- Minimum 2-tuple dominating set of an interval graph
- Minimum 2-tuple dominating set of permutation graphs
- Nordhaus-Gaddum inequalities for domination in graphs
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- Variations of \(Y\)-dominating functions on graphs
This page was built for publication: Approximation algorithms for double domination number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318091)
