Upward geometric graph embeddings into point sets
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
Cited in
(13)- Upward straight-line embeddings of directed graphs into point sets
- On upward point set embeddability
- Upward point set embeddings of paths and trees
- Computing upward topological book embeddings of upward planar digraphs
- Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points
- The point-set embeddability problem for plane graphs
- Upward Point-Set Embeddability
- Upward point set embeddability for convex point sets is in P
- Reprint of: ``Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets
- On 1-bend upward point-set embeddings of \(st\)-digraphs
- Upward pointset embeddings of planar st-graphs
- Upward pointset embeddings of planar \(st\)-graphs
This page was built for publication: Upward geometric graph embeddings into point sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073656)