Optimal point-set embedding of wheel graphs and a sub-class of 3-trees
DOI10.1007/s13160-016-0232-xzbMath1362.05090OpenAlexW2555477766MaRDI QIDQ2396907
Alireza Bagheri, Majid Hosseinzadegan
Publication date: 29 May 2017
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-016-0232-x
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Point-set embeddings of plane \(3\)-trees
- Minimum height path partitioning of trees
- A linear-time algorithm for drawing a planar graph on a grid
- Point-set embeddings of trees with given partial drawings
- Fast geometric approximation techniques and geometric embedding problems
- The rooted tree embedding problem into points in the plane
- On embedding an outer-planar graph in a point set
- On simple polygonalizations with optimal area
- The point-set embeddability problem for plane graphs
- Minimum-Area Drawings of Plane 3-Trees
- Manhattan-Geodesic Embedding of Planar Graphs
- Optimal Algorithms to Embed Trees in a Point Set
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
- Convex Maps
- Embedding planar graphs at fixed vertex locations
This page was built for publication: Optimal point-set embedding of wheel graphs and a sub-class of 3-trees
