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.
@article{arxiv.1012.2142,
title = {NP-completeness Proof: RBCDN Reduction Problem},
author = {Sujogya Banerjee and Shahrzad Shirazipourazad and Pavel Ghosh and Arunabha Sen},
journal= {arXiv preprint arXiv:1012.2142},
year = {2010}
}