THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS
DOI10.1142/S0218195913600091zbMath1297.68230OpenAlexW2133160845MaRDI QIDQ2875647
Martin Vatshelle, Therese C. Biedl
Publication date: 11 August 2014
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195913600091
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (2)
Cites Work
- Point-set embeddings of plane \(3\)-trees
- How to draw a planar graph on a grid
- Point-set embeddings of trees with given partial drawings
- Drawing colored graphs on colored points
- Drawing colored graphs with constrained vertex positions and few bends per edge
- Upward straight-line embeddings of directed graphs into point sets
- Graph minors. X: Obstructions to tree-decomposition
- Finding minimum area \(k\)-gons
- Call routing and the ratcatcher
- Graph minors. XVIII: Tree-decompositions and well-quasi-ordering
- Chordal embeddings of planar graphs
- On embedding an outer-planar graph in a point set
- On upward point set embeddability
- On the Hardness of Point-Set Embeddability
- CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS
- Upward Geometric Graph Embeddings into Point Sets
- Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees
- Convex Representations of Graphs
- The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing
- Complexity of Finding Embeddings in a k-Tree
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Point-Set Embeddability of 2-Colored Trees
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
- k-colored Point-set Embeddability of Outerplanar Graphs
- Minimizing the Area for Planar Straight-Line Grid Drawings
- Cutwidth I: A linear time fixed parameter algorithm
- Cutwidth II: Algorithms for partial w-trees of bounded degree
- Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
- Embedding planar graphs at fixed vertex locations
This page was built for publication: THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS
