Sliding column model for t-unit bar visibility representations of graphs
From MaRDI portal
Recommendations
Cites work
- A better heuristic for orthogonal graph drawings
- A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
- A unified approach to visibility representations of planar graphs
- Accelerated bend minimization
- Basic graph theory
- Drawing planar graphs using the canonical ordering
- scientific article; zbMATH DE number 2123122 (Why is no real title available?)
- scientific article; zbMATH DE number 1953108 (Why is no real title available?)
- scientific article; zbMATH DE number 2068172 (Why is no real title available?)
- No-bend orthogonal drawings and no-bend orthogonally convex drawings of planar graphs (extended abstract)
- On bend-minimized orthogonal drawings of planar 3-graphs
- On the computational complexity of upward and rectilinear planarity testing
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
- Optimal orthogonal drawings of triconnected plane graphs
- Orthogonal Drawings of Plane Graphs Without Bends
- Relating bends and size in orthogonal graph drawings
- Spirality and Optimal Orthogonal Drawings
- The Bar Visibility Number of a Graph
- The unit bar visibility number of a graph
This page was built for publication: Sliding column model for t-unit bar visibility representations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174768)