Cite
HARVARD Citation
Rana, A. et al. (2016). An efficient algorithm to solve the distance k-domination problem on permutation graphs. Journal of discrete mathematical sciences & cryptography. pp. 241-255. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Rana, A. et al. (2016). An efficient algorithm to solve the distance k-domination problem on permutation graphs. Journal of discrete mathematical sciences & cryptography. pp. 241-255. [Online].