Algorithms for graph partitioning problems by means of eigenspace relaxations

DOI10.1016/S0377-2217(99)00060-0zbMath0947.05072OpenAlexW2022619737MaRDI QIDQ1577115

Hsuanjen Cheng, Chih-Chien Tu, Ce-Kuen Shieh

Publication date: 30 August 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00060-0

zbMATH Keywords

eigenvaluesgraph partitioning\(k\)-cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Unnamed Item

Cites Work

• A parallel algorithm for bisection width in trees
• Some simplified NP-complete graph problems
• A computational study of graph partitioning
• Spectral methods for graph bisection problems.
• A projection technique for partitioning the nodes of a graph
• The variation of the spectrum of a normal matrix
• A New Heuristic for Partitioning the Nodes of a Graph
• A New Lower Bound Via Projection for the Quadratic Assignment Problem
• An Efficient Heuristic Procedure for Partitioning Graphs
• An Algorithm for Partitioning the Nodes of a Graph
• Lower Bounds for the Partitioning of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for graph partitioning problems by means of eigenspace relaxations