Graph layering by promotion of nodes

DOI10.1016/J.DAM.2005.05.023zbMATH Open1120.90064OpenAlexW2003825820MaRDI QIDQ2489908FDOQ2489908

Authors: Nikola S. Nikolov, Alexandre Tarassov 

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

Recommendations

• In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes
• Root demotion: efficient post-processing of layered graphs to reduce dummy vertices for hierarchical graph drawing
• scientific article; zbMATH DE number 1953098
• Generalized layerings for arbitrary and fixed drawing areas
• scientific article; zbMATH DE number 2084263

zbMATH Keywords

Graph drawingLayered directed acyclic graphLayering algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Title not available (Why is that?)
• Optimal scheduling for two-processor systems
• An experimental comparison of four graph drawing algorithms.
• NP-complete scheduling problems
• Title not available (Why is that?)
• Crossing Theory and Hierarchy Mapping
• Width-restricted layering of acyclic digraphs with consideration of dummy nodes
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

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

Uses Software

• LEDA

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489908)