The point-set embeddability problem for plane graphs
From MaRDI portal
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
Cites work
- Call routing and the ratcatcher
- Chordal embeddings of planar graphs
- Complexity of Finding Embeddings in a k-Tree
- Constrained point-set embeddability of planar graphs
- Convex Representations of Graphs
- Cutwidth I: A linear time fixed parameter algorithm
- Cutwidth II: Algorithms for partial w-trees of bounded degree
- Drawing colored graphs on colored points
- Drawing colored graphs with constrained vertex positions and few bends per edge
- Drawing graphs with vertices at specified positions and crossings at large angles
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Embedding planar graphs at fixed vertex locations
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Finding minimum area \(k\)-gons
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XVIII: Tree-decompositions and well-quasi-ordering
- How to draw a planar graph on a grid
- Improved algorithms for the point-set embeddability problem for plane 3-trees
- k-colored Point-set Embeddability of Outerplanar Graphs
- Minimizing the Area for Planar Straight-Line Grid Drawings
- On embedding an outer-planar graph in a point set
- On the hardness of point-set embeddability (extended abstract)
- On upward point set embeddability
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
- Point-set embeddability of 2-colored trees
- Point-set embeddings of plane 3-trees
- Point-set embeddings of trees with given partial drawings
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing
- Upward geometric graph embeddings into point sets
- Upward straight-line embeddings of directed graphs into point sets
Cited in
(12)- C-planarity testing of embedded clustered graphs with bounded dual carving-width
- Universal point sets for planar three-trees
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees
- The point-set embeddability problem for plane graphs
- On the hardness of point-set embeddability (extended abstract)
- Graphs embedded in the plane with a bounded number of accumulation points
- Kinetic and Stationary Point-Set Embeddability for Plane Graphs
- EMBEDDING POINT SETS INTO PLANE GRAPHS OF SMALL DILATION
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
- Graph Drawing
- On the complexity of embedding in graph products
- Drawn tree decomposition: new approach for graph drawing problems
This page was built for publication: The point-set embeddability problem for plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875647)
