Beyond level planarity

P. Angelini, G. Da Lozzo, G. Di Battista, F. Frati, M. Patrignani, I. Rutter

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

11 Citaten (Scopus)

Samenvatting


In this paper we settle the computational complexity of two open problems related to the extension of the notion of level planarity to surfaces different from the plane. Namely, we show that the problems of testing the existence of a level embedding of a level graph on the surface of the rolling cylinder or on the surface of the torus, respectively known by the name of Cyclic Level Planarity and Torus Level Planarity, are polynomial-time solvable.
Moreover, we show a complexity dichotomy for testing the Simultaneous Level Planarity of a set of level graphs, with respect to both the number of level graphs and the number of levels.
Research was partially supported by DFG grant Ka812/17-1, by MIUR project AMANDA, prot. 2012C4E3KT_001, and by DFG grant WA 654/21-1.
Originele taal-2Engels
TitelGraph Drawing and Network Visualization
Subtitel24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers
RedacteurenY. Hu, M. Nöllenburg
Plaats van productieDordrecht
UitgeverijSpringer
Pagina's482-495
ISBN van elektronische versie978-3-319-50106-2
ISBN van geprinte versie978-3-319-50105-5
DOI's
StatusGepubliceerd - 2016

Publicatie series

NaamLecture Notes in Computer Science
Volume9801

Vingerafdruk

Duik in de onderzoeksthema's van 'Beyond level planarity'. Samen vormen ze een unieke vingerafdruk.

Citeer dit