Graph minimum linear arrangement by multilevel weighted edge contractions

Authors:
Ilya Safro;Dorit Ron;Achi Brandt
Affiliations:
Faculty of Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel;Faculty of Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel;Faculty of Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel
Venue:
Journal of Algorithms
Year:
2006

Citing 13
Cited 11

Algebraic multigrid theory: The symmetric case

Applied Mathematics and Computation - Second Copper Mountain conference on Multigrid methods Copper Mountain, Colorado
Linear placement algorithm and applications to VLSI design

Networks
Optimal linear labelings and eigenvalues of graphs

Discrete Applied Mathematics
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
A multigrid tutorial: second edition

A multigrid tutorial: second edition
A review of algebraic multigrid

Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. VII: partial differential equations
Approximating layout problems on random geometric graphs

Journal of Algorithms
A survey of graph layout problems

ACM Computing Surveys (CSUR)
On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
A Multi-scale Algorithm for the Linear Arrangement Problem

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
The optimal linear arrangement problem: algorithms and approximation

The optimal linear arrangement problem: algorithms and approximation
Experiments on the minimum linear arrangement problem

Journal of Experimental Algorithmics (JEA)
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

Journal of Graph Theory

An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem

Computers and Operations Research
Multilevel algorithms for linear ordering problems

Journal of Experimental Algorithmics (JEA)
A new diffusion-based multilevel algorithm for computing graph partitions

Journal of Parallel and Distributed Computing
Graph partitioning and disturbed diffusion

Parallel Computing
Decorous Lower Bounds for Minimum Linear Arrangement

INFORMS Journal on Computing
Multiscale approach for the network compression-friendly ordering

Journal of Discrete Algorithms
Summarizing transactional databases with overlapped hyperrectangles

Data Mining and Knowledge Discovery
A refined evaluation function for the MinLA problem

MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Memetic algorithms for the MinLA problem

EA'05 Proceedings of the 7th international conference on Artificial Evolution
A comparison of memetic recombination operators for the MinLA problem

MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
An optimal time algorithm for minimum linear arrangement of chord graphs

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The minimum linear arrangement problem is widely used and studied in many practical and theoretical applications. In this paper we present a linear-time algorithm for the problem inspired by the algebraic multigrid approach which is based on weighted edge contraction rather than simple contraction. Our results turned out to be better than every known result in almost all cases, while the short running time of the algorithm enabled experiments with very large graphs.