Turning cliques into paths to achieve planarity
From MaRDI portal
Publication:1725735
DOI10.1007/978-3-030-04414-5_5MaRDI QIDQ1725735
Giuseppe Liotta, Seok-Hee Hong, Stephen G. Kobourov, Patrizio Angelini, Peter Eades, Alfredo Navarra, Alessandra Tappini, Karsten Klein
Publication date: 15 February 2019
Full work available at URL: https://arxiv.org/abs/1808.08925
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
