Daniel M. Bikel, Vittorio Castelli
ACL 2008
Paper
Complexity of finding k-path-free dominating sets in graphs
Abstract
No abstract available.
Related
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking