A New Heuristic for Partitioning the Nodes of a Graph
From MaRDI portal
Recommendations
Cited in
(23)- Optimal partitions having disjoint convex and conic hulls
- Spectral partitioning with multiple eigenvectors
- Two-stage m-way graph partitioning
- A computational study of graph partitioning
- An experimental evaluation of local search heuristics for graph partitioning
- Spectral methods for graph bisection problems.
- Algorithms for graph partitioning problems by means of eigenspace relaxations
- Partitioning of supply/demand graphs with capacity limitations: an ant colony approach
- Lock-gain based graph partitioning
- A stochastic heuristic visualising graph clusters in a bi-dimensional space prior to partitioning
- A projection technique for partitioning the nodes of a graph
- On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- Spectral bounds for graph partitioning with prescribed partition sizes
- A heuristic approach for dividing graphs into bi-connected components with a size constraint
- An efficient approach for large scale graph partitioning
- A heuristic method for solving the problem of partitioning graphs with supply and demand
- Finding part-machine families using graph partitioning techniques
- A fast and robust network bisection algorithm
- scientific article; zbMATH DE number 2080084 (Why is no real title available?)
- scientific article; zbMATH DE number 1560342 (Why is no real title available?)
- Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
- A method of improving initial partition of Fiduccia-Mattheyses algorithm
This page was built for publication: A New Heuristic for Partitioning the Nodes of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3802647)
