Re-embedding a 1-plane graph for a straight-line drawing in linear time
From MaRDI portal
Publication:2235768
DOI10.1016/j.tcs.2021.09.015OpenAlexW4210542918MaRDI QIDQ2235768
Seok-Hee Hong, Hiroshi Nagamochi
Publication date: 21 October 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.09.015
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- A linear-time algorithm for testing outer-1-planarity
- Drawing graphs with right angle crossings
- The structure of 1-planar graphs
- Optimal 1-planar graphs which triangulate other surfaces
- Planar graphs: Theory and algorithms
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- Gap-planar graphs
- Density of straight-line 1-planar graph drawings
- Path-monotonic upward drawings of graphs
- Beyond level planarity: cyclic, torus, and simultaneous level planarity
- Ein Sechsfarbenproblem auf der Kugel
- An annotated bibliography on 1-planarity
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- Algorithms for graphs embeddable with few crossings per edge
- Parameterized Complexity of 1-Planarity
- Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
- Fáry’s Theorem for 1-Planar Graphs
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
- Re-embeddings of Maximum 1-Planar Graphs
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
- Rectilinear drawings of graphs
- A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
- On-Line Planarity Testing
- Dividing a Graph into Triconnected Components
- Algorithms for 1-Planar Graphs
- Beyond Planar Graphs
- Acyclic colouring of 1-planar graphs
This page was built for publication: Re-embedding a 1-plane graph for a straight-line drawing in linear time
