Graph minimum linear arrangement by multilevel weighted edge contractions
DOI10.1016/J.JALGOR.2004.10.004zbMATH Open1096.68687OpenAlexW2049820532MaRDI QIDQ5483510FDOQ5483510
Authors: Ilya Safro, Dorit Ron, Achi Brandt
Publication date: 14 August 2006
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.10.004
Recommendations
simulated annealinggraphsinterpolationcombinatorial optimizationcoarseningrelaxationweighted aggregationminimum linear arrangementweighted edge contractionsmultilevel computations
Cited In (21)
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- Summarizing transactional databases with overlapped hyperrectangles
- Multilevel algorithms for linear ordering problems
- Relaxation-based coarsening for multilevel hypergraph partitioning
- Multiscale approach for the network compression-friendly ordering
- Approximation guarantees for the minimum linear arrangement problem by higher eigenvalues
- Maximum incomplete recursive circulants in graph embeddings
- Title not available (Why is that?)
- On a binary distance model for the minimum linear arrangement problem
- An optimal time algorithm for minimum linear arrangement of chord graphs
- Continuous quadratic programming formulations of optimization problems on graphs
- A multilevel bilinear programming algorithm for the vertex separator problem
- A New Lower Bound for the Minimum Linear Arrangement of a Graph
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
- New relationships for multi-neighborhood search for the minimum linear arrangement problem
- Fast simulated annealing for single-row equidistant facility layout
- Multilevel graph partitioning for three-dimensional discrete fracture network flow simulations
- A Multilevel Algorithm for the Minimum 2-sum Problem
- Aggregative coarsening for multilevel hypergraph partitioning
- Advanced coarsening schemes for graph partitioning
- ELRUNA: elimination rule-based network alignment
This page was built for publication: Graph minimum linear arrangement by multilevel weighted edge contractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483510)