Efficiently answering quality constrained shortest distance queries in large graphs
One of the fundamental concept in the graph-related problem is the shortest path distance.
This problem is widely studied for decades, and has numerous real-life applications …
This problem is widely studied for decades, and has numerous real-life applications …
Enumerating all multi-constrained s-t paths on temporal graph
Y Jin, Z Chen, W Liu - Knowledge and Information Systems, 2024 - Springer
In this paper, we propose the problem of multi-constrained st simple paths enumeration on
temporal graph, which aims to list all temporal paths with the minimum timestamp in the …
temporal graph, which aims to list all temporal paths with the minimum timestamp in the …
TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs
The feedback vertex set is one of 21 Np-complete problems proposed by Karp, aiming at
breaking all cycles in a given graph. It could be used in numerous areas, eg, program …
breaking all cycles in a given graph. It could be used in numerous areas, eg, program …
[图书][B] Efficient Connectivity Analysis and Path Management in Massive Graphs
Y Huang - 2023 - search.proquest.com
Graph analysis serves as a cornerstone in numerous real-world applications, spanning
domains like social networks, knowledge graphs, fraud detection, and trajectory monitoring …
domains like social networks, knowledge graphs, fraud detection, and trajectory monitoring …