Complexity of finding k-path-free dominating sets in graphs
- Reuven Bar-Yehuda
- Uzi Vishkin
- 1982
- Information Processing Letters
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.