Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs.
Andrés López-MartínezSagnik MukhopadhyayDanupon NanongkaiPublished in: SPAA (2021)
Keyphrases
- dynamic programming
- minimum cost
- graph structure
- parallel processing
- parallel computing
- graph representation
- minimum energy
- connected dominating set
- sparse representation
- directed graph
- random walk
- weighted graph
- graph model
- high dimensional
- parallel implementation
- globally optimal
- graph theoretic
- dominating set
- gaussian graphical models