A subspace semidefinite programming for spectral graph partitioning
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1560335
- Semidefinite programming relaxations for the graph partitioning problem
- scientific article; zbMATH DE number 1182569
- Semidefinite programming for graph partitioning with preferencesin data distribution
- An efficient semidefinite programming relaxation for the graph partition problem
Cited in
(17)- Graph partitioning using linear and semidefinite programming
- Semidefinite programming relaxations for the graph partitioning problem
- SDP-based bounds for graph partition via extended ADMM
- Semidefinite spectral clustering
- Sublinear time algorithms for approximate semidefinite programming
- Subgraph Matching with Semidefinite Programming
- Finding graph embeddings by incremental low-rank semidefinite programming
- 0-1 semidefinite programming for graph-cut clustering: modelling and approximation
- scientific article; zbMATH DE number 1182569 (Why is no real title available?)
- Unsupervised image partitioning with semidefinite programming
- Semidefinite programming for graph partitioning with preferencesin data distribution
- scientific article; zbMATH DE number 1560335 (Why is no real title available?)
- Subdomain cluster generation for domain decomposition methods using graph partitioning optimization
- How well do local algorithms solve semidefinite programs?
- Subsampling algorithms for semidefinite programming
- Towards an SDP-based approach to spectral methods: a nearly-linear-time algorithm for graph partitioning and decomposition
- On the identification of the optimal partition for semidefinite optimization
This page was built for publication: A subspace semidefinite programming for spectral graph partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4739106)
