Abstract
Alber et al. presented an algorithm for computing a dominating set of size at most k, if one exists, in an undirected planar n-vertex graph and bounded its execution time by O(8kn). Here it is shown that the algorithm performs better than claimed by its authors. More significantly, if k≤n/19, even a much simplified version of the algorithm runs in O(7kn) time.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
