Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
From MaRDI portal
Publication:5014135
DOI10.1007/978-3-030-68766-3_34OpenAlexW3134933682MaRDI QIDQ5014135FDOQ5014135
Authors: Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali 
Publication date: 1 December 2021
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.03784
Recommendations
- On the linearity of testing planarity of graphs
- A new approach to the linearity of testing planarity of graphs
- A linear-time algorithm for testing outer-1-planarity
- A linear-time algorithm for testing outer-1-planarity
- Testing Full Outer-2-planarity in Linear Time
- A linear-time algorithm for testing full outer-2-planarity
- On the computational complexity of upward and rectilinear planarity testing
- Planar Graphs: Logical Complexity and Parallel Isomorphism Tests
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
- Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Graph Drawing
- Title not available (Why is that?)
- Spirality and Optimal Orthogonal Drawings
- Orthogonal Drawings of Plane Graphs Without Bends
- Accelerated bend minimization
- A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
- Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sketched representations and orthogonal planarity of bounded treewidth graphs
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
- No-bend orthogonal drawings and no-bend orthogonally convex drawings of planar graphs (extended abstract)
Cited In (9)
- Rectilinear Planarity of Partial 2-Trees
- Testing Full Outer-2-planarity in Linear Time
- Unit-length rectangular drawings of graphs
- Grid straight-line embeddings of trees with a minimum number of bends per path
- Unit-length rectangular drawings of graphs
- Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
- Planar rectilinear drawings of outerplanar graphs in linear time
- Rectilinear planarity of partial 2-trees
- On the computational complexity of upward and rectilinear planarity testing
This page was built for publication: Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014135)
