[1]
Barman, S. et al. 2020. An optimal algorithm for computing minimum \(k\)-hop dominating set of permutation graphs. Serdica Mathematical Journal. 46, 1 (Jun. 2020), 43–60.