Thomas M. Cheng
IT Professional
Paper
Complexity of finding k-path-free dominating sets in graphs
Abstract
No abstract available.
Related
Maciel Zortea, Miguel Paredes, et al.
IGARSS 2021
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science