Back to papers
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs
Summary: Index-based reachability for temporal bipartite graphs using time-aware 2-hop labeling over time-constrained wedges. Optimizations and parallelization speed up index construction; supports single-source reachability and earliest-arrival path queries, validated on 16 real-world graphs.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 12368
- Venue
- VLDB
- Year
- 2021
- Pagerank
- 5.4498271e-05
- Overall Rank
- 5,540 | 61.47%
- DOI
-
10.14778/3467861.3467873
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 4,481 |
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs |
2024 |
VLDB |
6.1485442e-05 |
| 8,897 |
BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs |
2025 |
SIGMOD |
4.427232e-05 |
| 9,042 |
HR-Index: An Effective Index Method for Historical Reachability Queries over Evolving Graphs |
2023 |
SIGMOD |
4.4039656e-05 |
| 9,089 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs |
2024 |
SIGMOD |
4.39898e-05 |
| 9,405 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
4.3441378e-05 |
| 10,157 |
Efficient and Effective Biclique Counting with Local Differential Privacy |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,397 |
Bursting Flow Query on Large Temporal Flow Networks |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,563 |
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index |
2025 |
VLDB |
4.1945683e-05 |
| 10,584 |
Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs |
2025 |
VLDB |
4.1945683e-05 |
| 11,014 |
Efficient Regular Simple Path Queries under Transitive Restricted Expressions |
2024 |
VLDB |
4.1945683e-05 |
| 11,038 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
4.1945683e-05 |
| 11,060 |
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs |
2024 |
VLDB |
4.1945683e-05 |
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.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 260 |
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling |
2013 |
SIGMOD |
0.00030040036 |
| 279 |
3-HOP: A High-Compression Indexing Scheme for Reachability Query |
2009 |
SIGMOD |
0.00029113513 |
| 334 |
Fast and Practical Indexing and Querying of Very Large Graphs |
2007 |
SIGMOD |
0.00027081079 |
| 425 |
Stack-based Algorithms for Pattern Matching on DAGs |
2005 |
VLDB |
0.00023598882 |
| 733 |
GRAIL: Scalable Reachability Index for Large Graphs |
2010 |
VLDB |
0.00017460741 |
| 999 |
Effective Community Search for Large Attributed Graphs |
2016 |
VLDB |
0.00014726563 |
| 1,024 |
Path Problems in Temporal Graphs |
2014 |
VLDB |
0.00014609643 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011714263 |
| 1,553 |
A Memory Efficient Reachability Data Structure Through Bit Vector Compression |
2011 |
SIGMOD |
0.00011402871 |
| 1,555 |
Efficient Route Planning on Public Transportation Networks: A Labelling Approach |
2015 |
SIGMOD |
0.00011395261 |
| 1,654 |
An Experimental Study on Hub Labeling based Shortest Path Algorithms |
2018 |
VLDB |
0.000109978 |
| 1,823 |
Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks |
2014 |
VLDB |
0.00010413508 |
| 1,844 |
Effective Community Search over Large Spatial Graphs |
2017 |
VLDB |
0.00010341077 |
| 2,639 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3975113e-05 |
| 2,909 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
7.9305767e-05 |
| 3,213 |
Landmark Indexing for Evaluation of Label-Constrained Reachability Queries |
2017 |
SIGMOD |
7.3669794e-05 |
| 4,459 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.1651553e-05 |
| 4,478 |
Reachability Querying: An Independent Permutation Labeling Approach |
2014 |
VLDB |
6.1506256e-05 |
| 4,534 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.1049756e-05 |
| 6,795 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
4.9242446e-05 |
Semantically Similar Papers