A modified noising algorithm for the graph partitioning problem
From MaRDI portal
Publication:4397095
DOI10.1016/S0167-9260(97)00007-2zbMath0894.68064WikidataQ126528073 ScholiaQ126528073MaRDI QIDQ4397095
C. Siva Ram Murthy, V. J. Sudhakar
Publication date: 30 June 1998
Published in: Integration (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-9260(97)00007-2
heuristics; combinatorial optimization; simulated annealing; NP-hard; graph partitioning; clique partitioning; noising method
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
Related Items
The noising methods: A generalization of some metaheuristics, Noising methods for a clique partitioning problem, Self-tuning of the noising methods