Aug 28, 2021 · This paper proposes a new label-constrained 2-hop indexing method with innovative pruning rules and order strategies. Our work demonstrates that ...

Oct 22, 2024 · This paper proposes a new label-constrained 2-hop indexing method with innovative pruning rules and order strategies. Our work demonstrates that ...

In this paper, we propose an upper and lower bound-based search algorithm to answer the label- constrained k-reach (LCKR) query, namely ULKR. It is the first ...

Aug 12, 2023 · Reachability query plays a vital role in many graph analysis tasks. Previous researches proposed many methods to efficiently answer ...

In this paper, we study a variant of reachability queries, called label-constraint reachability (LCR) queries, specifically,given a label set S and two ...

On such edge-labeled graphs, an important query is the label-constrained reachability (LCR) query, where we are given a source s, a target t, a label set Ψ, and ...

In other words, any reachability query can be simply answered by taking the intersection of the source vertex's out-label set and the terminal vertex's in-label ...

Answering reachability and K-reach queries on large graphs with label constraints · Computer Science. The VLDB Journal · 2021.

We propose a simple yet effective partition-based framework (local path-label transitive closure+online traversal) to answer LCR queries in large graphs.

To fill this research gap, in this paper, we study the reachability problem on temporal bipartite graphs. Specifically, a vertex u reaches a ver- tex w in a ...