An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning

DOI10.1007/978-3-540-74450-4_6MaRDI QIDQ3611897zbMATH OpenOpenAlexFDO

Authors Lingyu Sun, Ming Leng

Publication date 3 March 2009

Published in Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74450-4_6

Mathematics Subject Classification ID

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

Recommendations

• An effective multilevel tabu search approach for balanced graph partitioning
• scientific article; zbMATH DE number 1961985
• Artificial Evolution
• A combined evolutionary search and multilevel optimisation approach to graph-partitioning
• Multilevel graph partitioning: an evolutionary approach

Cited in

(1)

• Using swarm intelligence algorithm to solve a part clustering model based on weighted directed graph

Describes a project that uses

Uses Software

• METIS

This page was built for publication: An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning

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