Optirefine: densest subgraphs and maximum cuts with k refinements
Sign Up to like & getrecommendations! Published in 2025 at "Data Mining and Knowledge Discovery"
DOI: 10.1007/s10618-025-01142-2
Abstract: Data-analysis tasks often involve an iterative process, which requires refining previous solutions. For instance, when analyzing social networks, we may obtain initial communities based on noisy metadata, and we want to improve them by adding… read more here.
Keywords: densest subgraph; document; maximum cut; optirefine densest ... See more keywords
On solving the densest k-subgraph problem on large graphs
Sign Up to like & getrecommendations! Published in 2020 at "Optimization Methods and Software"
DOI: 10.1080/10556788.2019.1595620
Abstract: ABSTRACT The densest k-subgraph problem is the problem of finding a k-vertex subgraph of a graph with the maximum number of edges. In order to solve large instances of the densest k-subgraph problem, we introduce… read more here.
Keywords: densest subgraph; problem; subgraph problem; problem large ... See more keywords
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