A carregar...
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...
Na minha lista:
| Publicado no: | Entropy (Basel) |
|---|---|
| Main Authors: | , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
MDPI
2019
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7514591/ https://ncbi.nlm.nih.gov/pubmed/33266824 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/e21020108 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|