Cited By
View all- Chen XShi JPeng YLin WWang SZhang W(2024)Minimum Strongly Connected Subgraph Collection in Dynamic GraphsProceedings of the VLDB Endowment10.14778/3648160.364817317:6(1324-1336)Online publication date: 3-May-2024
- Zeng YFang YMa CZhou XLi K(2024)Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale GraphsProceedings of the ACM on Management of Data10.1145/36392772:1(1-25)Online publication date: 26-Mar-2024
- Chen LKyng RLiu YMeierhans SProbst Gutenberg MMohar BShinkar IO'Donnell R(2024)Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost FlowProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649745(1165-1173)Online publication date: 10-Jun-2024
- Show More Cited By