scientific article; zbMATH DE number 3991298
From MaRDI portal
Publication:3753826
Recommendations
- An exact algorithm for graph partitioning
- Algorithms for graph partitioning problems by means of eigenspace relaxations
- The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
- A cutting plane algorithm for modularity maximization problem
- scientific article; zbMATH DE number 3891429
Cited in
(34)- Compact mathematical formulation for graph partitioning
- Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization
- Facet-defining inequalities for the simple graph partitioning polytope
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- scientific article; zbMATH DE number 3856823 (Why is no real title available?)
- Cutting plane algorithms for solving a stochastic edge-partition problem
- scientific article; zbMATH DE number 3924818 (Why is no real title available?)
- An overview of graph covering and partitioning
- A cutting plane algorithm for a clustering problem
- scientific article; zbMATH DE number 5990414 (Why is no real title available?)
- Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
- scientific article; zbMATH DE number 4029297 (Why is no real title available?)
- Lifting theorems and facet characterization for a class of clique partitioning inequalities
- A cutting-plane approach to the edge-weighted maximal clique problem
- An exact algorithm for graph partitioning
- The branch and cut method for the clique partitioning problem
- On the solution of a graph partitioning problem under capacity constraints
- The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- Linear and quadratic programming approaches for the general graph partitioning problem
- On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions
- scientific article; zbMATH DE number 1982182 (Why is no real title available?)
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- scientific article; zbMATH DE number 4070666 (Why is no real title available?)
- An extended edge-representative formulation for the \(K\)-partitioning problem
- Constrained Min-Cut Replication for K-Way Hypergraph Partitioning
- Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm
- A cutting plane algorithm for modularity maximization problem
- A minimal surface criterion for graph partitioning
- Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes
- scientific article; zbMATH DE number 1560342 (Why is no real title available?)
- Multiset graph partitioning
- Partitioning graphs on message-passing machines by pairwise mincut
- Generating partitions of a graph into a fixed number of minimum weight cuts
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753826)
