G. Ramalingam
Theoretical Computer Science
Paper
Complexity of finding k-path-free dominating sets in graphs
Abstract
No abstract available.
Related
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Yao Qi, Raja Das, et al.
ISSTA 2009