On the Complexity of Clustered-Level Planarity and T-Level Planarity
Data Structures and Algorithms
2014-06-26 v1 Computational Geometry
Abstract
In this paper we study two problems related to the drawing of level graphs, that is, T-LEVEL PLANARITY and CLUSTERED-LEVEL PLANARITY. We show that both problems are NP-complete in the general case and that they become polynomial-time solvable when restricted to proper instances.
Keywords
Cite
@article{arxiv.1406.6533,
title = {On the Complexity of Clustered-Level Planarity and T-Level Planarity},
author = {Patrizio Angelini and Giordano Da Lozzo and Giuseppe Di Battista and Fabrizio Frati and Vincenzo Roselli},
journal= {arXiv preprint arXiv:1406.6533},
year = {2014}
}
Comments
10 pages, 4 figures