Layered Drawing of Undirected Graphs with Generalized Port Constraints

DOI10.1007/978-3-030-68766-3_18MaRDI QIDQ5014119zbMATH OpenOpenAlexFDO

Authors Julian Walter, Johannes Zink, Joachim Baumeister, Alexander Wolff

Publication date 1 December 2021

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2008.10583

zbMATH Keywords

experimental evaluationport constraintsSugiyama framework

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• Drawing graphs in two layers
• Faster force-directed graph drawing with the well-separated pair decomposition
• scientific article; zbMATH DE number 2084264 (Why is no real title available?)
• The three-phase method: a unified approach to orthogonal graph drawing

Cited in

(3)

• Layered drawing of undirected graphs with generalized port constraints
• Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
• 2-Layer Graph Drawings with Bounded Pathwidth

This page was built for publication: Layered Drawing of Undirected Graphs with Generalized Port Constraints

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