\(\langle \alpha, \beta, \gamma \rangle\)-drawings
Definition
Background
Complexity
\(\langle \alpha, \beta, \gamma \rangle\)-drawings is NP-complete for instances…
- TODO
Partial Solutions
- TODO
Related Problems
Angelini, Patrizio, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, and Vincenzo Roselli. 2015. “Relaxing the Constraints of Clustered Planarity.” Computational Geometry 48 (2): 42–75. https://doi.org/10.1016/j.comgeo.2014.08.001.