Simultaneous drawing of layered trees

DOI10.1007/978-981-97-0566-5_5MaRDI QIDQ6575380

Stephen G. Kobourov, Maximilian Pfister, Johannes Zink, Julia Katheder, Axel Kuckuk

Publication date: 19 July 2024

zbMATH Keywords

layered drawingtree drawingdynamic programXP-algorithmcrossing-minimization

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• On optimal linear arrangements of trees
• Edge crossings in drawings of bipartite graphs
• Empirical evaluation of aesthetics-based graph layout
• A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
• On bipartite drawings and the linear arrangement problem
• k-Level Crossing Minimization Is NP-Hard for Trees
• Crossing Number is NP-Complete

This page was built for publication: Simultaneous drawing of layered trees