The Complexity of Angular Resolution
From MaRDI portal
Publication:6075714
DOI10.7155/jgaa.00634zbMath1522.05330MaRDI QIDQ6075714
Publication date: 20 September 2023
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Fixed points, Nash equilibria, and the existential theory of the reals
- Simple realizability of complete abstract topological graphs in P
- RAC-drawability is \(\exists \mathbb{R} \)-complete
- On the Complexity of the Planar Slope Number Problem
- The Minimal Polynomial of cos(2π/n)
- Drawing Graphs in the Plane with High Resolution
- Drawing Cubic Graphs with the Four Basic Slopes
- Complexity of Some Geometric and Topological Problems
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- A Note on Rectilinearity and Angular Resolution
- Angular Resolutions: Around Vertices and Crossings
- The Art Gallery Problem is ∃ℝ-complete
- Complexity of Geometric k-Planarity for Fixed k
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
