NP-completeness Proof: RBCDN Reduction Problem

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.