1 paper
Xuankun Liao, Qing Liu, Jiaxin Jiang +3
Given a directed graph G and integers k and l, a D-core is the maximal subgraph H⊆G such that for every vertex of H, its in-degree and out-degree are no smaller…