It Pays to Be Lazy: Reusing Force Approximations to Compute Better Graph Layouts Faster.
Robert GovePublished in: FMT (2018)
Keyphrases
- graph theory
- graph theoretic
- graph representation
- random walk
- structured data
- graph structure
- bipartite graph
- weighted graph
- efficient computation
- graph structures
- graph search
- memory efficient
- graphical representation
- graph matching
- learning algorithm
- neural network
- highly efficient
- directed graph
- approximation methods
- real time