Doubly Nonnegative and Semidefinite Relaxations for the Densest <i>k</i>-Subgraph Problem
The densest <i>k</i>-subgraph (DkS) maximization problem is to find a set of <i>k</i> vertices with maximum total weight of edges in the subgraph induced by this set. This problem is in general NP-hard. In this paper, two relaxation methods for solving the DkS problem are pre...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-01-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1099-4300/21/2/108 |