Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Paper
Complexity of finding k-path-free dominating sets in graphs
Abstract
No abstract available.
Related
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
Conference paper
COUNTERFACTUAL CONCEPT BOTTLENECK MODELS
Gabriele Dominici, Pietro Barbiero, et al.
ICLR 2025
Conference paper
Association control in mobile wireless networks
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008