Non-aligned Drawings of Planar Graphs
From MaRDI portal
Publication:2961510
DOI10.1007/978-3-319-50106-2_11zbMath1478.68217arXiv1606.02220OpenAlexW2470646738MaRDI QIDQ2961510
Claire Pennarun, Therese C. Biedl
Publication date: 21 February 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.02220
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Unnamed Item
- Unnamed Item
- How to draw a planar graph on a grid
- On triangulating planar graphs under the four-connectivity constraint
- The rectangle of influence drawability problem
- Arc Diagrams, Flip Distances, and Hamiltonian Triangulations
- Rook-Drawing for Plane Graphs
- Drawing Planar Graphs with Many Collinear Vertices
- Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames
- Approximation algorithms for NP-complete problems on planar graphs
- Faster scaling algorithms for general graph matching problems
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- The (3,1)-ordering for 4-connected planar triangulations
This page was built for publication: Non-aligned Drawings of Planar Graphs
