A randomized algorithm for determining dominating sets in graphs of maximum degree five

DOI10.1016/j.tcs.2009.08.011zbMath1194.68256OpenAlexW1973286099MaRDI QIDQ1034633

Hanaa A. E. Essa, Sameh S. Daoud, Soheir Mohamed Khamis

Publication date: 6 November 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.08.011

zbMATH Keywords

randomized algorithmpolynomial-time approximation algorithmminimum dominating setLas Vegas technique

Mathematics Subject Classification ID

Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithmics for hard problems.
• A note on the complexity of minimum dominating set
• Graph-Theoretic Concepts in Computer Science
• Approximation and Online Algorithms

This page was built for publication: A randomized algorithm for determining dominating sets in graphs of maximum degree five