The Generalized Mean Densest Subgraph Problem
The Generalized Mean Densest Subgraph Problem
Finding dense subgraphs of a large graph is a standard problem in graph mining that has been studied extensively both for its theoretical richness and its many practical applications. In this paper we introduce a new family of dense subgraph objectives, parameterized by a single parameter p, based on computing …