An experimental evaluation of local search heuristics for graph partitioning

DOI10.1007/BF02684361zbMath0892.68072OpenAlexW1999244193MaRDI QIDQ1382773

Lenwood S. Heath, Joseph L. Ganley

Publication date: 18 March 1998

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02684361

zbMATH Keywords

simulated annealingtabu searchgenetic algorithmslocal optimizationhierarchical hybrid approach

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Graph theory (05C99) Information storage and retrieval of data (68P20)

Related Items (1)

Hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A framework for solving VLSI graph layout problems
• Finding good approximate vertex and edge partitions is NP-hard
• Heuristics for laying out information graphs
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
• Tabu Search—Part I
• Tabu Search—Part II
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations

This page was built for publication: An experimental evaluation of local search heuristics for graph partitioning