Width-restricted layering of acyclic digraphs with consideration of dummy nodes
type: Item
instance of: scholarly article
title: Width-restricted layering of acyclic digraphs with consideration of dummy nodes
zbMATH Open document ID: 1032.68117
DOI: 10.1016/S0020-0190(01)00200-9
author: Stefan Leppert
author: Martin Middendorf
author: Peter Eades
author: Jürgen Branke
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1767430
zbMATH Keywords: Graph drawing
zbMATH Keywords: Width-restricted layering
zbMATH Keywords: Computational complexity
MaRDI profile type: Publication
cites work: Optimal scheduling for two-processor systems
cites work: Q3985344
cites work: Q4198056
Recommended article: In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes
Recommended article: Layout of Graphs with Bounded Tree-Width
Recommended article: Q4422266
Recommended article: Digraph width measures in parameterized algorithmics
Recommended article: Deriving a class of layer-oriented graph algorithms
Recommended article: The dag-width of directed graphs
Recommended article: A Generalization of the Directed Graph Layering Problem
Recommended article: On Digraph Width Measures in Parameterized Algorithmics
Recommended article: Layered graphs: applications and algorithms
Recommended article: Approximation algorithms for digraph width parameters
description: scientific article; zbMATH DE number 1767430