Lock-gain based graph partitioning
From MaRDI portal
Publication:1826489
DOI10.1023/B:HEUR.0000019985.94952.ebzbMath1069.68599MaRDI QIDQ1826489
Publication date: 6 August 2004
Published in: Journal of Heuristics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (4)
Moving clusters within a memetic algorithm for graph partitioning ⋮ A new adaptive Hungarian mating scheme in genetic algorithms ⋮ A note on edge-based graph partitioning and its linear algebraic structure ⋮ A heuristic method for solving the problem of partitioning graphs with supply and demand
This page was built for publication: Lock-gain based graph partitioning