Balancing performance and complexity with adaptive graph coarsening.
Marek DedicLukás BajerPavel ProcházkaMartin HolenaPublished in: Tiny Papers @ ICLR (2024)
Keyphrases
- minimum spanning tree
- computational complexity
- graph partitioning
- multiscale
- graph representation
- polynomial time complexity
- random walk
- graph theoretic
- directed graph
- real time
- bipartite graph
- directed acyclic graph
- weighted graph
- graph structure
- graph matching
- decision problems
- structured data
- website
- graph theory
- connected components
- graphical representation
- markov chain
- graph based algorithm