Efficient Processing of <i>k</i>-Hop Reachability Queries on Directed Graphs
Given a directed graph, a <i>k</i>-hop reachability query, <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>u</mi><mover><mo>→</mo><mrow><mo>?</m...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-03-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/13/6/3470 |