A New Heuristic for Partitioning the Nodes of a Graph

DOI10.1137/0401030zbMath0655.68089OpenAlexW2134085311MaRDI QIDQ3802647

Anthony Vannelli, James Q. Walker, Earl R. Barnes

Publication date: 1988

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0401030

zbMATH Keywords

linear programminggraph partitioning

Mathematics Subject Classification ID

Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Related Items (13)

A computational study of graph partitioning ⋮ Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée ⋮ 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 ⋮ Partitioning of supply/demand graphs with capacity limitations: an ant colony approach ⋮ Spectral methods for graph bisection problems. ⋮ Optimal partitions having disjoint convex and conic hulls ⋮ Mixed-integer programming techniques for the connected max-\(k\)-cut problem ⋮ Spectral partitioning with multiple eigenvectors ⋮ Algorithms for graph partitioning problems by means of eigenspace relaxations ⋮ Spectral bounds for graph partitioning with prescribed partition sizes ⋮ Finding part-machine families using graph partitioning techniques ⋮ A heuristic method for solving the problem of partitioning graphs with supply and demand

This page was built for publication: A New Heuristic for Partitioning the Nodes of a Graph