The greedy algorithm for domination in graphs of maximum degree 3

DOI10.1016/J.IPL.2003.10.007zbMath1183.68436OpenAlexW2074177397MaRDI QIDQ1029047

Suzanne M. Seager

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.10.007

zbMATH Keywords

algorithmsdominating setmaximum size

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Analysis of a greedy heuristic for finding small dominating sets in graphs
• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• A Greedy Heuristic for the Set-Covering Problem
• Paths, Stars and the Number Three

This page was built for publication: The greedy algorithm for domination in graphs of maximum degree 3