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

Information Processing Letters

Volumn 81, Issue 2, 2002, Pages 59-63

  Branke, Jürgen ^a   Leppert, Stefan ^a   Middendorf, Martin ^a   Eades, Peter ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b UNIVERSITY OF SYDNEY   (Australia)

Author keywords

Computational complexity; Graph drawing; Width restricted layering

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS;

ACYCLIC DIGRAPHS;

DATA PROCESSING;

EID: 0037203617     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00200-9     Document Type: Article

References (5)

1. Optimal scheduling for two-processor systems
2. How to draw a directed graph
3. Methods for visual understanding of hierarchical system structures