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

DOI10.1016/S0020-0190(01)00200-9zbMath1032.68117MaRDI QIDQ1603521

Martin Middendorf, Peter Eades, Stefan Leppert, Juergen Branke

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Computational complexityGraph drawingWidth-restricted layering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Crossing-constrained hierarchical drawings ⋮ Graph layering by promotion of nodes ⋮ A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width

Cites Work

• Optimal scheduling for two-processor systems
• Unnamed Item
• Unnamed Item

This page was built for publication: Width-restricted layering of acyclic digraphs with consideration of dummy nodes