On the complexity of orthogonal compaction
From MaRDI portal
Recommendations
Cites work
- Computing orthogonal drawings with the minimum number of bends
- Embedding rectilinear graphs in linear time
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1342138 (Why is no real title available?)
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Parallel concepts in graph theory
- Rectilinear Graphs and Their Embeddings
- Turn-regularity and optimal area drawings of orthogonal representations
Cited in
(29)- Optimal three-dimensional orthogonal graph drawing in the general position model.
- On embedding a graph in the grid with the maximum number of bends and other bad features
- Efficient cell-based migration of VLSI layout
- A better heuristic for area-compaction of orthogonal representations
- Orthogonal drawings of graphs with vertex and edge labels
- Minimum rectilinear polygons for given angle sequences
- scientific article; zbMATH DE number 2185601 (Why is no real title available?)
- scientific article; zbMATH DE number 2084272 (Why is no real title available?)
- Inapproximability of orthogonal compaction
- Hardness of approximate compaction for nonplanar orthogonal graph drawings
- On the Query Complexity of Testing Orientations for Being Eulerian
- scientific article; zbMATH DE number 5528957 (Why is no real title available?)
- scientific article; zbMATH DE number 1342138 (Why is no real title available?)
- scientific article; zbMATH DE number 2080085 (Why is no real title available?)
- Drawing database schemas
- Orthogonal-ordering constraints are tough
- On Turn-Regular Orthogonal Representations
- On turn-regular orthogonal representations
- Upward planar drawings with two slopes
- A combinatorial approach to orthognal placement problems
- Graph Drawing
- Computational complexity of compaction to irreflexive cycles
- Parameterized approaches to orthogonal compaction
- Recognition and proper coloring of unit segment intersection graphs
- Parameterized approaches to orthogonal compaction
- Drawn tree decomposition: new approach for graph drawing problems
- Ortho-radial drawing in near-linear time
- Minimum rectilinear polygons for given angle sequences
- Complexity results for three-dimensional orthogonal graph drawing
This page was built for publication: On the complexity of orthogonal compaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5943322)
