Planar rectilinear drawings of outerplanar graphs in linear time
From MaRDI portal
Publication:2123284
Recommendations
- Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
- Area-efficient planar straight-line drawings of outerplanar graphs
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
- scientific article; zbMATH DE number 3885930
- scientific article; zbMATH DE number 1974107
- A linear-time algorithm for drawing a planar graph on a grid
- Graph Drawing
- scientific article; zbMATH DE number 4049084
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
- Computing β-Drawings of 2-Outerplane Graphs in Linear Time
Cites work
- A linear algorithm for embedding planar graphs using PQ-trees
- Accelerated bend minimization
- Bend-minimum orthogonal drawings in quadratic time
- Characterizations of outerplanar graphs
- Efficient Planarity Testing
- Graph Drawing
- scientific article; zbMATH DE number 4049084 (Why is no real title available?)
- scientific article; zbMATH DE number 1953108 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
- 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 Embedding a Graph in the Grid with the Minimum Number of Bends
- On the computational complexity of upward and rectilinear planarity testing
- One-Page Book Embedding under Vertex-Neighborhood Constraints
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
- Orthogonal Drawings of Plane Graphs Without Bends
- Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
- Orthogonal graph drawing with inflexible edges
- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
- Sketched representations and orthogonal planarity of bounded treewidth graphs
- Spirality and Optimal Orthogonal Drawings
Cited in
(20)- Embedding rectilinear graphs in linear time
- A linear-time algorithm for testing full outer-2-planarity
- One-bend drawings of outerplanar graphs inside simple polygons
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
- Computing β-Drawings of 2-Outerplane Graphs in Linear Time
- SOFSEM 2005: Theory and Practice of Computer Science
- Splitting plane graphs to outerplanarity
- Rectilinear planarity of partial 2-trees
- Testing upward planarity of partial 2-trees
- Linear-time rectilinear drawings of subdivisions of triconnected cubic planar graphs with orthogonally convex faces
- Rectilinear Planarity of Partial 2-Trees
- On the parameterized complexity of bend-minimum orthogonal planarity
- Upward and orthogonal planarity are W[1]-hard parameterized by treewidth
- On the parameterized complexity of bend-minimum orthogonal planarity
- Unit-length rectangular drawings of graphs
- Splitting plane graphs to outerplanarity
- Rectilinear-upward planarity testing of digraphs
- Rectilinear-upward planarity testing of digraphs
- Upward and rectilinear planarity are W[1]-hard parameterized by treewidth
- Area-efficient planar straight-line drawings of outerplanar graphs
This page was built for publication: Planar rectilinear drawings of outerplanar graphs in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2123284)
