SDP-based bounds for graph partition via extended ADMM.
Angelika WiegeleShudian ZhaoPublished in: Comput. Optim. Appl. (2022)
Keyphrases
- partitioning algorithm
- graph structure
- upper bound
- lower bound
- vertex set
- structured data
- directed graph
- graph theory
- graph model
- graph representation
- random walk
- connected components
- swendsen wang
- semidefinite program
- graph partitioning
- directed acyclic graph
- weighted graph
- undirected graph
- lower and upper bounds
- semidefinite programming
- graph mining
- semi definite programming
- graph matching