O'Reach: Even Faster Reachability in Large Graphs.
Kathrin HanauerChristian SchulzJonathan TrummerPublished in: SEA (2021)
Keyphrases
- graph theory
- graph theoretic
- directed graph
- subgraph isomorphism
- transitive closure
- graph databases
- state space
- graph structure
- graph mining
- graph theoretical
- real time
- graph matching
- pairwise
- information retrieval
- data sets
- bipartite graph
- graph model
- pattern recognition
- complex structures
- graph representation
- case study
- website
- graph data
- random graphs
- memory efficient
- adjacency matrix