COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗

DOI10.1080/10637199608915544zbMath1049.68942OpenAlexW1995493739MaRDI QIDQ4820145

Burkhard Monien, Carsten Spräner, Reinhard Lüling, Ralf Diekmann

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Related Items (1)

Vertex ordering and partitioning problems for random spatial graphs.

Uses Software

• MESHPART
• Chaco
• TOP/DOMDEC

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

This page was built for publication: COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗