Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Paper
Complexity of finding k-path-free dominating sets in graphs
Abstract
No abstract available.
Related
Fan Zhang, Junwei Cao, et al.
IEEE TETC
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
Bowen Zhou, Bing Xiang, et al.
SSST 2008