Efficient k-step Weighted Reachability Queries Processing Algorithms
Authors:
- 25 March 2025
- journal article
- research article
- Published by Springer Nature in Arabian Journal for Science and Engineering
- Vol. 50 (19) , 16149-16166
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Natural Science Foundation of China (No. 62272097, No. 61873337)
- Natural Science Foundation of China (No. 62372101)
This publication has 26 references indexed in Scilit:
- Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs2023
- Distributed Set Label-Constrained Reachability Queries over Billion-Scale Graphs2022
- Answering reachability and K-reach queries on large graphs with label constraintsThe VLDB Journal, 2021
- Efficiently Answering Span-Reachability Queries in Large Temporal Graphs2020
- ARROW: Approximating Reachability Using Random Walks Over Web-Scale Graphs2019
- Computing weight constraint reachability in large networksThe VLDB Journal, 2012
- Minimum -path vertex coverDiscrete Applied Mathematics, 2011
- Decomposing DAGs into spanning trees: A new way to compress transitive closures2011
- An Efficient Algorithm for Answering Graph Reachability Queries2008
- Dual Labeling: Answering Graph Reachability Queries in Constant Time2006