The point-set embeddability problem for plane graphs. (English) Zbl 1293.05060
Proceedings of the 28th annual symposium on computational geometry, SoCG 2012, Chapel Hill, NC, USA, June 17–20, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1299-8). 41-50 (2012).
MSC:
| 05C10 | Planar graphs; geometric and topological aspects of graph theory |
| 05C40 | Connectivity |
| 68Q17 | Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) |
| 68Q25 | Analysis of algorithms and problem complexity |
