Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs

Authors

• 1. Xiaoshuang Chen (University of New South Wales)
• 2. Kai Wang (University of New South Wales)
• 3. Xuemin Lin (University of New South Wales)
• 4. Wenjie Zhang (University of New South Wales)
• 5. Lu Qin (University of Technology Sydney)
• 6. Ying Zhang (University of Technology Sydney)

@article{chen_vldb21,
        title = {{Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs}},
        author = {Chen, Xiaoshuang and Wang, Kai and Lin, Xuemin and Zhang, Wenjie and Qin, Lu and Zhang, Ying},
        journal = {PVLDB},
        series = {{VLDB} '21},
        volume = {14},
        number = {10},
        pages = {1845--1858},
        doi = {10.14778/3467861.3467873},
        url = {https://doi.org/10.14778/3467861.3467873},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Outgoing Citations (Sorted by Pagerank)

Showing 20 of 20 cited papers.

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

Semantically Similar Papers