In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes

Authors:
Nikola S. Nikolov;Alexandre Tarassov;Jürgen Branke
Affiliations:
University of Limerick and IMAGEN Group, Sydney, Australia;University of Limerick and IMAGEN Group, Sydney, Australia and IBM HPC Group, Dublin Software Lab, Damastown Industrial Estate, Mullhadart, Dublin 15, Ireland;University of Karlsruhe, Karlsruhe, Germany
Venue:
Journal of Experimental Algorithmics (JEA)
Year:
2005

Citing 12
Cited 2

Graph algorithms and NP-completeness

Graph algorithms and NP-completeness
Integer and combinatorial optimization

Integer and combinatorial optimization
How to draw a directed graph

Journal of Information Processing
A fast and effective heuristic for the feedback arc set problem

Information Processing Letters
An experimental comparison of four graph drawing algorithms

Computational Geometry: Theory and Applications
Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
Width-restricted layering of acyclic digraphs with consideration of dummy nodes

Information Processing Letters
A Technique for Drawing Directed Graphs

IEEE Transactions on Software Engineering
How to Layer a Directed Acyclic Graph

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Graph layering by promotion of nodes

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
GEOMI: GEOmetry for maximum insight

GD'05 Proceedings of the 13th international conference on Graph Drawing

An integrated model for visualizing biclusters from gene expression data and PPI networks

ISB '10 Proceedings of the International Symposium on Biocomputing
Drawing graphs with GLEE

GD'07 Proceedings of the 15th international conference on Graph drawing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose two fast heuristics for solving the NP-hard problem of graph layering with the minimum width and consideration of dummy nodes. Our heuristics can be used at the layer-assignment phase of the Sugiyama method for drawing of directed graphs. We evaluate our heuristics by comparing them to the widely used fast-layering algorithms in an extensive computational study with nearly 6000 input graphs. We also demonstrate how the well-known longest-path and Coffman--Graham algorithms can be used for finding narrow layerings with acceptable aesthetic properties.