An efficient orthogonal grid drawing algorithm for cubic graphs
From MaRDI portal
Recommendations
- Algorithms for area-efficient orthogonal drawing
- A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
- A linear-time algorithm for bend-optimal orthogonal drawings of biconnected cubic plane graphs
- Orthogonally drawing cubic graphs in parallel
- Three-dimensional orthogonal graph drawing algorithms
Cites work
- At most single-bend embeddings of cubic graphs
- Drawing planar graphs using the canonical ordering
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
- Wide-Angle Pair Production and Quantum Electrodynamics at Small Distances
Cited in
(4)
This page was built for publication: An efficient orthogonal grid drawing algorithm for cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6064011)