A randomized algorithm for determining dominating sets in graphs of maximum degree five
From MaRDI portal
(Redirected from Publication:1034633)
Recommendations
- An exact algorithm for maximum independent set in degree-5 graphs
- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs
- Classification of efficient dominating sets of circulant graphs of degree 5
- Randomized algorithms and upper bounds for multiple domination in graphs and networks
- Domination in graphs of minimum degree five
- scientific article; zbMATH DE number 861311
- Randomized greedy algorithms for finding smallk-dominating sets of regular graphs
- scientific article; zbMATH DE number 2011847
- Random procedures for dominating sets in graphs
- Improved upper bounds on the domination number of graphs with minimum degree at least five
Cites work
- A note on the complexity of minimum dominating set
- Algorithmics for hard problems.
- Approximation and Online Algorithms
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
Cited in
(4)- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
- scientific article; zbMATH DE number 861311 (Why is no real title available?)
- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs
- An exact algorithm for maximum independent set in degree-5 graphs
This page was built for publication: A randomized algorithm for determining dominating sets in graphs of maximum degree five
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1034633)
