Upward Planarity Testing of Embedded Mixed Graphs

Binucci, Carla and Didimo, Walter (2012) Upward Planarity Testing of Embedded Mixed Graphs. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011 , pp. 427-432(Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_40).

Full text not available from this repository.


A mixed graph has both directed and undirected edges. We study an upward planarity testing problem for embedded mixed graphs and solve it using Integer Linear Programming. Experiments show the efficiency of our technique.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-25878-7_40
Classifications: G Algorithms and Complexity > G.490 Embeddings
G Algorithms and Complexity > G.770 Planarity Testing
P Styles > P.840 Upward
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1275

Actions (login required)

View Item View Item