Finding Dense Subgraphs via Low-Rank Bilinear Optimization

Dimitris S. Papailiopoulos, Ioannis Mitliagkas, Alexandros G. Dimakis, Constantine Caramanis

Abstract: Given a graph, the Densest k-Subgraph (\DkS) problem asks for the subgraph on k vertices that contains the largest number of edges. In this work, we develop a novel algorithm for \DkS that searches...