Cargando…
Doubly Nonnegative and Semidefinite Relaxations for the Densest k-Subgraph Problem
The densest k-subgraph (DkS) maximization problem is to find a set of k 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 presented. One is doubly nonnegative rela...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
MDPI
2019
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7514591/ https://www.ncbi.nlm.nih.gov/pubmed/33266824 http://dx.doi.org/10.3390/e21020108 |