Width-restricted layering of acyclic digraphs with consideration of dummy nodes

Authors:
Jürgen Branke;Stefan Leppert;Martin Middendorf;Peter Eades
Affiliations:
-;Institute AIFB, University of Karlsruhe, D-76128 Karlsruhe, Germany;Institute AIFB, University of Karlsruhe, D-76128 Karlsruhe, Germany;Basser Department of Computer Science, University of Sydney, Sydney, NSW Australia
Venue:
Information Processing Letters
Year:
2002

Citing 3
Cited 6

How to draw a directed graph

Journal of Information Processing
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

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
In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes

Journal of Experimental Algorithmics (JEA)
Graph layering by promotion of nodes

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Upward planarization layout

GD'09 Proceedings of the 17th international conference on Graph Drawing
Crossing-constrained hierarchical drawings

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper deals with the problem of finding graph layerings restricted to a given maximal width. However, other than previous approaches for width-restricted layering, we take into account the space for dummy nodes, which are introduced by edges crossing a layer. The main result is that the problem of finding a width-restricted layering under consideration of dummy nodes is NP-complete even when all regular nodes have the same constant width and all dummy nodes have the same constant width.