On the Upward Planarity of Mixed Plane Graphs

Frati, Fabrizio and Kaufmann, Michael and Pach, János and Tóth, Csaba D. and Wood, David R. (2013) On the Upward Planarity of Mixed Plane Graphs. In: 21st International Symposium, GD 2013 , September 23-25, 2013 , pp. 1-12(Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_1).

Full text not available from this repository.

Abstract

A mixed plane graph is a plane graph whose edge set is partitioned into a set of directed edges and a set of undirected edges. An orientation of a mixed plane graph G is an assignment of directions to the undirected edges of G resulting in a directed plane graph TeX . In this paper, we study the computational complexity of testing whether a given mixed plane graph G is upward planar, i.e., whether it admits an orientation resulting in a directed plane graph G such that G admits a planar drawing in which each edge is represented by a curve monotonically increasing in the y-direction according to its orientation. Our contribution is threefold. First, we show that the upward planarity testing problem is solvable in cubic time for mixed outerplane graphs. Second, we show that the problem of testing the upward planarity of mixed plane graphs reduces in quadratic time to the problem of testing the upward planarity of mixed plane triangulations. Third, we exhibit linear-time testing algorithms for two classes of mixed plane triangulations, namely mixed plane 3-trees and mixed plane triangulations in which the undirected edges induce a forest.

Item Type: Conference Paper
Classifications: G Algorithms and Complexity > G.770 Planarity Testing
G Algorithms and Complexity > G.840 Planarization
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 13 Aug 2014 13:00
Last Modified: 22 May 2015 13:00
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1356

Actions (login required)

View Item View Item