Lock-gain based graph partitioning

DOI10.1023/B:HEUR.0000019985.94952.EBMaRDI QIDQ1826489zbMATH OpenFDO

Authors Yong-Hyuk Kim, Byung-Ro Moon

Publication date 6 August 2004

Published in Journal of Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/B:HEUR.0000019985.94952.EB

zbMATH Keywords

graph bisectiongraph partitioningheuristic algorithmsiterative improvementlock gaintie-breaking

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A New Heuristic for Partitioning the Nodes of a Graph
• scientific article; zbMATH DE number 7286677
• ILP-Based Local Search for Graph Partitioning
• scientific article; zbMATH DE number 910878
• An efficient approach for large scale graph partitioning

Cited in

(4)

• Moving clusters within a memetic algorithm for graph partitioning
• A new adaptive Hungarian mating scheme in genetic algorithms
• A heuristic method for solving the problem of partitioning graphs with supply and demand
• A note on edge-based graph partitioning and its linear algebraic structure

This page was built for publication: Lock-gain based graph partitioning

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