Correlation Constraint Shortest Path over Large Multi-Relation Graphs
Summary: Shortest path under vertex-correlation constraints on multi-relational graphs with recursive necessity and denial; extends beyond edge-label reachability. HyRE encodes topology and relation types compactly to prune search; evaluated on real-world graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xiaofei Zhang
- 2. M. Tamer Özsu
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,795 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB | 4.9242446e-05 |
| 11,064 | Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks | 2024 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next