Algorithmic aspects of the k-domination problem in graphs
From MaRDI portal
(Redirected from Algorithmic aspects of the k-domination problem in graphs)
Algorithmic aspects of the \(k\)-domination problem in graphs
Algorithmic aspects of the \(k\)-domination problem in graphs
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)
Recommendations
Cites work
- \(k\)-domination and \(k\)-independence in graphs: A survey
- A linear algorithm for finding a minimum dominating set in a cactus
- A linear algorithm for the domination number of a tree
- A new domination conception
- A note on the k-domination number of a graph
- Algorithmic aspect of k-tuple domination in graphs.
- An upper bound for thek-domination number of a graph
- scientific article; zbMATH DE number 3898784 (Why is no real title available?)
- scientific article; zbMATH DE number 1302196 (Why is no real title available?)
- scientific article; zbMATH DE number 731842 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 4121429 (Why is no real title available?)
- On the p-domination, the total domination and the connected domination numbers of graphs
- Onk-domination and minimum degree in graphs
- Upper bounds for \(f\)-domination number of graphs
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
Cited in
(37)- Labeling algorithms for domination problems in sun-free chordal graphs
- Multiple domination models for placement of electric vehicle charging stations in road networks
- A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree
- Algorithmic aspect of k-tuple domination in graphs.
- Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph
- The complexity of the defensive domination problem in special graph classes
- Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
- Heuristics for \(k\)-domination models of facility location problems in street networks
- Domination and convexity problems in the target set selection model
- The algorithmic complexity of \(k\)-domatic partition of graphs
- \((1, j)\)-set problem in graphs
- Clique domination in graphs.
- Multiple domination
- scientific article; zbMATH DE number 4039319 (Why is no real title available?)
- On the algorithmic complexity of \(k\)-tuple total domination
- scientific article; zbMATH DE number 1735803 (Why is no real title available?)
- Tree-like structure graphs with full diversity of balls
- A labeling algorithm for distance domination on block graphs
- scientific article; zbMATH DE number 1416465 (Why is no real title available?)
- Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs
- On the k-hop domination numbers of spanning trees of unicyclic graphs
- An efficient algorithm to solve the distance \(k\)-domination problem on permutation graphs
- The strong domination problem in block graphs and proper interval graphs
- Enumeration of labeled block-cactus graphs
- Algorithmic aspects of total k-subdomination in graphs
- Algorithmic aspects of k-part degree restricted domination in graphs
- k-Efficient domination: Algorithmic perspective
- Computing maximum matchings in temporal graphs
- Algorithmic study on 2-transitivity of graphs
- Partial domination in some geometric intersection graphs
- Parameterized complexity of (d, r)-domination via modular decomposition
- Approximation algorithms and ratios for multiple domination in graphs
- The k-neighbor domination problem
- A linear time algorithm for optimal \(k\)-hop dominating set of a tree
This page was built for publication: Algorithmic aspects of the \(k\)-domination problem in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446334)
