Algorithms for the Balanced Edge Partitioning Problem

DOI10.1007/978-3-540-72845-0_24zbMath1203.68128OpenAlexW1551186540MaRDI QIDQ5432325

Daniel R. Tauritz, Ekaterina Smorodkina, Mayur Thakur

Publication date: 2 January 2008

Published in: Experimental Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72845-0_24

zbMATH Keywords

heuristicsgraph partitioningbalanced graph partitioningKernighan-Lin heuristic

Mathematics Subject Classification ID

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

This page was built for publication: Algorithms for the Balanced Edge Partitioning Problem