NP-completeness Proof: RBCDN Reduction Problem
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.
cs.CC↗
arXiv subjects
Sujogya Banerjee
Publications and source records attributed to Sujogya Banerjee.