Graph layering by promotion of nodes

Authors:
Nikola S. Nikolov;Alexandre Tarassov
Affiliations:
Department of Computer Science and Information Systems, University of Limerick, Limerick, Ireland;Department of Computer Science and Information Systems, University of Limerick, Limerick, Ireland
Venue:
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Year:
2006

Citing 10
Cited 2

Integer and combinatorial optimization

Integer and combinatorial optimization
How to draw a directed graph

Journal of Information Processing
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
The LEDA Platform of Combinatorial and Geometric Computing

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm

GD '96 Proceedings of the Symposium on Graph Drawing
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

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

Journal of Experimental Algorithmics (JEA)
On the stability properties of linear dynamic time-varying unforced systems involving switches between parameterizations from topologic considerations via graph theory

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work contributes to the wide research area of visualization of hierarchical graphs. We present a new polynomial-time heuristic which can be integrated into the Sugiyama method for drawing hierarchical graphs. Our heuristic, which we call Promote Layering (PL), is applied to the output of the layering phase of the Sugiyama method. PL is a simple and easy to implement algorithm which decreases the number of so-called dummy (or virtual) nodes in a layered directed acyclic graph. In particular, we propose applying PL after the longest-path layering algorithm and we present an extensive empirical evaluation of this layering technique.