A PROBE-Based Heuristic for Graph Partitioning

DOI10.1109/TC.2007.70760MaRDI QIDQ4564264zbMATH OpenOpenAlexFDO

Authors Pierre Chardaire, Musbah Barake, 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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cited in

(6)

• An experimental evaluation of local search heuristics for graph partitioning
• Speeding up a memetic algorithm for the max-bisection problem
• A heuristic approach for dividing graphs into bi-connected components with a size constraint
• Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
• An effective multilevel tabu search approach for balanced graph partitioning
• An exact combinatorial algorithm for minimum graph bisection

This page was built for publication: A PROBE-Based Heuristic for Graph Partitioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564264)