Straight-Line Drawability of a Planar Graph Plus an Edge
From MaRDI portal
Publication:3449828
DOI10.1007/978-3-319-21840-3_25zbMath1444.68141arXiv1504.06540OpenAlexW1940972405WikidataQ62041743 ScholiaQ62041743MaRDI QIDQ3449828
Peter Eades, Sheung-Hung Poon, Naoki Katoh, Seok-Hee Hong, Giuseppe Liotta
Publication date: 30 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.06540
Related Items (10)
Straight-Line Drawability of a Planar Graph Plus an Edge ⋮ An annotated review on graph drawing and its applications ⋮ A linear-time algorithm for testing full outer-2-planarity ⋮ How to Draw a Planarization ⋮ Inserting an edge into a geometric embedding ⋮ Inserting an edge into a geometric embedding ⋮ Polyline drawings with topological constraints ⋮ Polyline Drawings with Topological Constraints ⋮ Beyond Planar Graphs: Introduction ⋮ Algorithms for 1-Planar Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Convex drawings of graphs with non-convex boundary constraints
- Planar orientations with low out-degree and compaction of adjacency matrices
- Area requirement and symmetry display of planar upward drawings
- Inserting an edge into a planar graph
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs
- Fáry’s Theorem for 1-Planar Graphs
- Straight-Line Drawability of a Planar Graph Plus an Edge
- Rectilinear drawings of graphs
- Level Planar Embedding in Linear Time
- Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
This page was built for publication: Straight-Line Drawability of a Planar Graph Plus an Edge