On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs
From MaRDI portal
(Redirected from Publication:5321707)
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
- On the complexity of embedding planar graphs to minimize certain distance measures
- On some plane graphs and their metric dimension
- Minimal reducible bounds for planar graphs
- scientific article; zbMATH DE number 3258070
- Geometric Representation of Graphs in Low Dimension
- Minimal Euclidean representations of graphs
- Minimal non-1-planar graphs
- On the minimal reducible bound for outerplanar and planar graphs
- Approximate min-max relations on plane graphs
- A note on minimum-segment drawings of planar graphs
Cites work
- A left-first search algorithm for planar graphs
- Canonical ordering trees and their applications in graph drawing
- Graph Drawing
- scientific article; zbMATH DE number 739017 (Why is no real title available?)
- NP-Completeness of st-Orientations for Plane Graphs
- On Finding the Rectangular Duals of Planar Triangular Graphs
- On Representation of Planar Graphs by Segments
- Rectangular duals of planar graphs
- Straight-Line Drawing of Quadrangulations
This page was built for publication: On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5321707)
