Graph Compact Orthogonal Layout Algorithm

DOI10.1007/978-3-319-09174-7_22zbMath1445.68160arXiv1807.09368OpenAlexW2277476232MaRDI QIDQ3195336

Jans Glagoļevs, Karlis Freivalds

Publication date: 16 October 2015

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

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Area-efficient static and incremental graph drawings
• A better heuristic for orthogonal graph drawings
• An experimental comparison of four graph drawing algorithms.
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Techniques for the Refinement of Orthogonal Graph Drawings
• Graph Drawing
• Graph Drawing

This page was built for publication: Graph Compact Orthogonal Layout Algorithm