A computational study of graph partitioning
From MaRDI portal
Recommendations
- Algorithms for graph partitioning problems by means of eigenspace relaxations
- A projection technique for partitioning the nodes of a graph
- Spectral bounds for graph partitioning with prescribed partition sizes
- Constructive Heuristics and Lower Bounds for Graph Partitioning Based on a Principal-Components Approximation
Cites work
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 4076973 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 3554030 (Why is no real title available?)
- A MIMD implementation of a parallel Euler solver for unstructured grids
- A New Heuristic for Partitioning the Nodes of a Graph
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A projection technique for partitioning the nodes of a graph
- An Algorithm for Partitioning the Nodes of a Graph
- An Efficient Heuristic Procedure for Partitioning Graphs
- Lower Bounds for the Partitioning of Graphs
- Matrix Analysis
- More bounds for eigenvalues using traces
- Optimal linear labelings and eigenvalues of graphs
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- The equipartition polytope. I: Formulations, dimension and basic facets
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Cited in
(34)- scientific article; zbMATH DE number 6501141 (Why is no real title available?)
- The MIN-cut and vertex separator problem
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
- An Updated Experimental Evaluation of Graph Bipartization Methods
- Spectral methods for graph bisection problems.
- A projection technique for partitioning the nodes of a graph
- Semidefinite programming relaxations for the graph partitioning problem
- A class of bounded approximation algorithms for graph partitioning
- scientific article; zbMATH DE number 3855167 (Why is no real title available?)
- scientific article; zbMATH DE number 4094840 (Why is no real title available?)
- Spectral partitioning with multiple eigenvectors
- An optimal tree search method for the manufacturing systems cell formation problem
- New abilities and limitations of spectral graph bisection
- Spectral bounds for graph partitioning with prescribed partition sizes
- Graph partitioning: an updated survey
- A novel graph-based partitioning algorithm for large-scale dynamical systems
- Semidefinite approximations for quadratic programs over orthogonal matrices
- Comparison of algorithms in graph partitioning
- Semidefinite programming and combinatorial optimization
- Constructive Heuristics and Lower Bounds for Graph Partitioning Based on a Principal-Components Approximation
- Orbitopal fixing
- scientific article; zbMATH DE number 1942408 (Why is no real title available?)
- scientific article; zbMATH DE number 3924818 (Why is no real title available?)
- On spectral bounds for the \(k\)-partitioning of graphs
- Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
- scientific article; zbMATH DE number 3871421 (Why is no real title available?)
- A note on edge-based graph partitioning and its linear algebraic structure
- An exact algorithm for graph partitioning
- scientific article; zbMATH DE number 5761786 (Why is no real title available?)
- General introduction to graph partitioning
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- Algorithms for graph partitioning problems by means of eigenspace relaxations
- scientific article; zbMATH DE number 1617249 (Why is no real title available?)
- A complementary column generation approach for the graph equipartition problem
This page was built for publication: A computational study of graph partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340061)
