A multi-scale algorithm for the linear arrangement problem

MaRDI QIDQ4414506zbMATH OpenFDO

Authors Yehuda Koren, David Harel

Publication date 25 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2573/25730296.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Multilevel MLA algorithm and its application in graph partitioning problem
• Multilevel algorithms for linear ordering problems
• Graph minimum linear arrangement by multilevel weighted edge contractions
• Multiscale approach for the network compression-friendly ordering
• Experiments on the minimum linear arrangement problem

Cited in

(12)

• Parameterized algorithmics for linear arrangement problems
• Locating sets of identical machines in a linear layout
• Improved exact approaches for row layout problems with departments of equal length
• scientific article; zbMATH DE number 4139504 (Why is no real title available?)
• Multilevel MLA algorithm and its application in graph partitioning problem
• On a binary distance model for the minimum linear arrangement problem
• Lower and upper bounds for the linear arrangement problem on interval graphs
• Multilevel algorithms for linear ordering problems
• Graph minimum linear arrangement by multilevel weighted edge contractions
• Multiscale approach for the network compression-friendly ordering
• Embedding augmented cube into certain trees and windmill graphs
• A probabilistic algorithm for optimal linear arrangements

This page was built for publication: A multi-scale algorithm for the linear arrangement problem

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