Skip to main content
Research
Focus areas
Blog
Publications
Careers
About
Back
Focus areas
Semiconductors
Artificial Intelligence
Quantum Computing
Hybrid Cloud
Back
About
Overview
Labs
People
Back
Semiconductors
Back
Artificial Intelligence
Back
Quantum Computing
Back
Hybrid Cloud
Back
Overview
Back
Labs
Back
People
Research
Focus areas
Semiconductors
Artificial Intelligence
Quantum Computing
Hybrid Cloud
Blog
Publications
Careers
About
Overview
Labs
People
Open IBM search field
Close
Information Processing Letters
Paper
23 Jul 1982
Complexity of finding k-path-free dominating sets in graphs
View publication
Abstract
No abstract available.
Related
Conference paper
FETA: Towards Specializing Foundational Models for Expert Task Applications
Workshop paper
pyp2pcluster: A cluster discovery tool
Conference paper
Scalable Fine-Grained Parallel Cycle Enumeration Algorithms
Invited paper
Software Services Engineering Manifesto – A Cross-Cutting Declaration
View all publications
