Chenhao Ma

Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs

2020

Given a directed graph G, the directed densest subgraph (DDS) problem refers to the finding of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS problem is …