A randomized algorithm for determining dominating sets in graphs of maximum degree five
From MaRDI portal
Publication:1034633
DOI10.1016/j.tcs.2009.08.011zbMath1194.68256MaRDI QIDQ1034633
Sameh S. Daoud, Hanaa A. E. Essa, 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
randomized algorithm; polynomial-time approximation algorithm; minimum dominating set; Las Vegas technique
Related Items
Cites Work