Back to Search
Start Over
NP-completeness Proof: RBCDN Reduction Problem
- Publication Year :
- 2010
-
Abstract
- Computational complexity of the design problem for a network with a target value of Region-Based Component Decomposition Number (RBCDN) has been proven to be NP-complete.
Details
- Database :
- OAIster
- Publication Type :
- Electronic Resource
- Accession number :
- edsoai.ocn729840777
- Document Type :
- Electronic Resource