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