Finding Connected-Dense-Connected Subgraphs and variants is NP-Hard
Dhara Shah, Sushil K. Prasad, Yubao Wu · Digital Archive @ GSU · 2019
Finding Connected-Dense-Connected (CDC) subgraphs from Triple Networks is NP-Hard. finding One-Connected-Dense (OCD) sub- graphs from Triple Networks is also NP-Hard. We present formal proofs of these theorems hereby.