Orthogonal drawing of high degree graphs with small area and few bends

DOI10.1007/3-540-63307-3_74zbMath1497.68392OpenAlexW1593961019MaRDI QIDQ5096952

Achilleas Papakostas, Ioannis. G. Tollis

Publication date: 19 August 2022

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

Full work available at URL: https://doi.org/10.1007/3-540-63307-3_74

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Computing an st-numbering
• Graphs drawn with few crossings per edge
• Algorithms for drawing graphs: An annotated bibliography
• Drawing graphs on rectangular grids
• Drawing planar graphs using the canonical ordering
• An experimental comparison of four graph drawing algorithms.
• On minimal-node-cost planar embeddings
• On Embedding a Graph in the Grid with the Minimum Number of Bends