Graph bisection revisited
From MaRDI portal
Publication:1657405
DOI10.1007/s10479-017-2575-3zbMath1392.90120arXiv1611.07382OpenAlexW2553694558WikidataQ59515483 ScholiaQ59515483MaRDI QIDQ1657405
Publication date: 13 August 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.07382
Related Items (2)
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs ⋮ Partitioning through projections: strong SDP bounds for large graph partition problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Clustering of high throughput gene expression data
- The MIN-cut and vertex separator problem
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Some simplified NP-complete graph problems
- The node capacitated graph partitioning problem: A computational study
- Min-cut clustering
- Graph partitioning and parallel computing
- An improved rounding method and semidefinite programming relaxation for graph partition
- A new approach to minimising the frontwidth in finite element calculations
- Tabu search for graph partitioning
- On semidefinite programming relaxations of maximum \(k\)-section
- Semidefinite programming relaxations for the graph partitioning problem
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
- Relaxations of Combinatorial Problems Via Association Schemes
- SDP Relaxations for Some Combinatorial Optimization Problems
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem
- Multiple-way network partitioning
- Solving Graph Bisection Problems with Semidefinite Programming
- Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing
- Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
This page was built for publication: Graph bisection revisited
