Heuristics and meta-heuristics for 2-layer straight line crossing minimization

Authors:
Rafael Martí;Manuel Laguna
Affiliations:
Departamento de Estadística e I.O. Universidad de Valencia. Dr. Moliner 50, 46100 Burjassot, (Valencia), Spain;Leeds School of Business, University of Colorado, 419 UCB, Boulder, CO
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 7
Cited 4

DAG—a program that draws directed graphs

Software—Practice & Experience
The Stanford GraphBase: a platform for combinatorial computing

The Stanford GraphBase: a platform for combinatorial computing
Arc crossing minimization in hierarchical digraphs with tabu search

Computers and Operations Research
Tabu Search

Tabu Search
A Technique for Drawing Directed Graphs

IEEE Transactions on Software Engineering
Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization

GD '95 Proceedings of the Symposium on Graph Drawing
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization

INFORMS Journal on Computing

Exploring Multiple Trees through DAG Representations

IEEE Transactions on Visualization and Computer Graphics
Using biclustering for automatic attribute selection to enhance global visualization

VIEW'06 Proceedings of the 1st first visual information expert conference on Pixelization paradigm
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem

Journal of Combinatorial Optimization
An SDP approach to multi-level crossing minimization

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.04

Visualization

Abstract

This paper presents extensive computational experiments to compare 12 heuristics and 2 meta-heuristics for the problem of minimizing straight-line crossings in a 2-layer graph. These experiments show that the performance of the heuristics (largely based on simple ordering rules) drastically deteriorates as the graphs become sparser. A tabu search metaheuristic yields the best results for relatively dense graphs, with a GRASP implementation as close second. Furthermore, the GRASP approach outperforms all other approaches when tackling low-density graphs.