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

DOI10.1080/10637199608915544zbMATH Open1049.68942OpenAlexW1995493739MaRDI QIDQ4820145FDOQ4820145

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

• Optimization by simulated annealing
• Title not available (Why is that?)
• A Separator Theorem for Planar Graphs
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• Title not available (Why is that?)
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• How Good is Recursive Bisection?
• Title not available (Why is that?)
• Combining simulated annealing with local search heuristics
• Sparse matrix test problems
• Title not available (Why is that?)

Cited In (2)

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

Uses Software

• MESHPART
• Chaco
• TOP/DOMDEC

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)