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.
|Title of host publication
|Graph Drawing and Network Visualization
|Subtitle of host publication
|24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers
|Y. Hu, M. Nöllenburg
|Place of Publication
|Published - 2016
|Lecture Notes in Computer Science