Simultaneous drawing of layered trees

DOI10.1007/978-981-97-0566-5_5MaRDI QIDQ6575380zbMATH OpenFDO

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

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1007/978-981-97-0566-5_5

zbMATH Keywords

crossing-minimizationdynamic programlayered drawingtree drawingXP-algorithm

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• k-level crossing minimization is NP-hard for trees
• A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
• Crossing Number is NP-Complete
• Edge crossings in drawings of bipartite graphs
• Empirical evaluation of aesthetics-based graph layout
• scientific article; zbMATH DE number 2084271 (Why is no real title available?)
• On bipartite drawings and the linear arrangement problem
• On optimal linear arrangements of trees

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

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