Testing Gap k-planarity is NP-complete
From MaRDI portal
Publication:6321495
DOI10.1016/j.ipl.2020.106083zbMath1516.68075arXiv1907.02104MaRDI QIDQ6321495
John C. Urschel, Jake L. Wellens
Publication date: 3 July 2019
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: Testing Gap k-planarity is NP-complete