Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs

Authors

• 1. Chenhao Ma (University of Hong Kong)
• 2. Yixiang Fang (University of New South Wales)
• 3. Reynold Cheng (University of Hong Kong)
• 4. Laks V.S. Lakshmanan (University of British Columbia)
• 5. Wenjie Zhang (University of New South Wales)
• 6. Xuemin Lin (University of New South Wales)

@inproceedings{ma_sigmod20,
        title = {{Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs}},
        author = {Ma, Chenhao and Fang, Yixiang and Cheng, Reynold and Lakshmanan, Laks V.S. and Zhang, Wenjie and Lin, Xuemin},
        series = {{SIGMOD} '20},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3318464.3389697},
        url = {https://dl.acm.org/doi/10.1145/3318464.3389697},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 25 of 25 citing papers.

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Semantically Similar Papers