Upward Point-Set Embeddability
From MaRDI portal
Publication:3075525
DOI10.1007/978-3-642-18381-2_23zbMath1298.05085arXiv1010.5937OpenAlexW2997113937MaRDI QIDQ3075525
Michael Kaufmann, Markus Geyer, Antonios Symvonis, Tamara Mchedlidze
Publication date: 15 February 2011
Published in: SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.5937
Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points ⋮ Reprint of: ``Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points ⋮ Upward Point Set Embeddability for Convex Point Sets Is in P ⋮ On upward point set embeddability
Cites Work
- Unnamed Item
- Upward straight-line embeddings of directed graphs into point sets
- On embedding an outer-planar graph in a point set
- On upward point set embeddability
- Upward Geometric Graph Embeddings into Point Sets
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Optimal Algorithms to Embed Trees in a Point Set
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs
This page was built for publication: Upward Point-Set Embeddability
