Skip to main navigation menu Skip to main content Skip to site footer

← Return to Article Details Download Download PDF

An optimal algorithm for computing minimum \(k\)-hop dominating set of permutation graphs