Graph layering by promotion of nodes

DOI10.1016/j.dam.2005.05.023zbMath1120.90064OpenAlexW2003825820MaRDI QIDQ2489908

Alexandre Tarassov, Nikola S. Nikolov

Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.05.023

zbMATH Keywords

Graph drawingLayered directed acyclic graphLayering algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (2)

On the stability properties of linear dynamic time-varying unforced systems involving switches between parameterizations from topologic considerations via graph theory ⋮ Drawing Graphs with GLEE

Uses Software

• LEDA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• NP-complete scheduling problems
• Width-restricted layering of acyclic digraphs with consideration of dummy nodes
• An experimental comparison of four graph drawing algorithms.
• Optimal scheduling for two-processor systems
• Crossing Theory and Hierarchy Mapping

This page was built for publication: Graph layering by promotion of nodes