Thumbnail Image
Item

Finding Connected-Dense-Connected Subgraphs and variants is NP-Hard

Shah, Dhara
; 
Prasad, Sushil
; 
Wu, Yubao
Citations
Altmetric:
Abstract

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.

Comments
These proofs are a part of a paper in progress
Description
Date
2019-04-03
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Computer Science Technical Reports
Show all metadata
Files
Thumbnail Image
cdc_nphard.pdf
Adobe PDF, 231.67 KB
Research Projects
Organizational Units
Journal Issue
Keywords
Triple Networks, Conneced-Dense-Connected, NP-Hard
Citation
Embargo Lift Date
URI
https://hdl.handle.net/20.500.14694/3658
DOI
Embedded videos