Doubly Nonnegative and Semidefinite Relaxations for the Densest k-Subgraph Problem
Sign Up to like & getrecommendations! Published in 2019 at "Entropy"
DOI: 10.3390/e21020108
Abstract: 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… read more here.
Keywords: relaxation; densest subgraph; doubly nonnegative; problem ... See more keywords