O'Reach: Even Faster Reachability in Large Graphs.
Kathrin HanauerChristian SchulzJonathan TrummerPublished in: ACM J. Exp. Algorithmics (2022)
Keyphrases
- graph theory
- state space
- memory efficient
- graph matching
- graph theoretic
- graph mining
- structured objects
- similarity measure
- graph theoretical
- directed graph
- graph representation
- graph structure
- labeled graphs
- series parallel
- graph clustering
- spanning tree
- highly efficient
- neural network
- pattern mining
- pattern recognition
- bayesian networks
- database systems
- search engine