Complexity of Geometric k-Planarity for Fixed k

Autor:	Marcus Schaefer
Rok vydání:	2021
Předmět:	Combinatorics Computational Theory and Mathematics General Computer Science Geometry and Topology Planarity testing Computer Science Applications Theoretical Computer Science Mathematics
Zdroj:	Journal of Graph Algorithms and Applications. 25:29-41
ISSN:	1526-1719
DOI:	10.7155/jgaa.00548
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::ae4cf5f55b39c573a1d6206ee5d72c2a https://doi.org/10.7155/jgaa.00548 Zobrazit plný text záznamu