COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗
From MaRDI portal
Publication:4820145
DOI10.1080/10637199608915544zbMath1049.68942MaRDI QIDQ4820145
Burkhard Monien, Reinhard Lüling, Ralf Diekmann, Carsten Spräner
Publication date: 6 October 2004
Published in: Parallel Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10637199608915544
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
68W15: Distributed algorithms
Related Items
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Combining simulated annealing with local search heuristics
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Sparse matrix test problems
- A Separator Theorem for Planar Graphs
- How Good is Recursive Bisection?
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item