A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery

Authors

• 1. Chenhao Ma (University of Hong Kong)
• 2. Yixiang Fang (Chinese University of Hong Kong)
• 3. Reynold Cheng (University of Hong Kong)
• 4. Laks V.S. Lakshmanan (University of British Columbia)
• 5. Xiaolin Han (University of Hong Kong)

@inproceedings{ma_sigmod22,
        title = {{A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery}},
        author = {Ma, Chenhao and Fang, Yixiang and Cheng, Reynold and Lakshmanan, Laks V.S. and Han, Xiaolin},
        series = {{SIGMOD} '22},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3514221.3517837},
        url = {https://dl.acm.org/doi/10.1145/3514221.3517837},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 20 of 20 citing papers.

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

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

Semantically Similar Papers