Complexity of finding k-path-free dominating sets in graphs
- 1 July 1982
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 14 (5) , 228-232
- https://doi.org/10.1016/0020-0190(82)90021-7
Abstract
No abstract availableThis publication has 1 reference indexed in Scilit:
- Problems and methods with multiple objective functionsMathematical Programming, 1971