A PROBE-Based Heuristic for Graph Partitioning
From MaRDI portal
Publication:4564264
DOI10.1109/TC.2007.70760zbMath1390.90547OpenAlexW2117271622MaRDI QIDQ4564264
Musbah Barake, Pierre Chardaire, G. P. McKeown
Publication date: 12 June 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.2007.70760
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
An effective multilevel tabu search approach for balanced graph partitioning, Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm, An exact combinatorial algorithm for minimum graph bisection, Speeding up a memetic algorithm for the max-bisection problem