Finding Densest Subgraphs with Edge-Color Constraints

Lutz Oettershagen, Honglian Wang, Aristides Gionis

We consider a variant of the densest subgraph problem in networks with single or multiple edge attributes. For example, in a social network, the edge attributes may describe the ty…