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

DOI10.1080/10637199608915544MaRDI QIDQ4820145zbMATH OpenOpenAlexFDO

Authors Reinhard Lüling, Burkhard Monien, Carsten Spräner, 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)

Cites work

• scientific article; zbMATH DE number 3841211 (Why is no real title available?)
• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 49142 (Why is no real title available?)
• scientific article; zbMATH DE number 934529 (Why is no real title available?)
• A Separator Theorem for Planar Graphs
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• Combining simulated annealing with local search heuristics
• How Good is Recursive Bisection?
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Optimization by simulated annealing
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Sparse matrix test problems

Cited in

(2)

• Vertex ordering and partitioning problems for random spatial graphs.
• On k-partitioning the n-cube

Describes a project that uses

Uses Software

• TOP/DOMDEC
• Chaco
• MESHPART

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820145)