Upward planarity testing of embedded mixed graphs

Authors:
Carla Binucci;Walter Didimo
Affiliations:
Dip. Ing. Elettronica e dell'Informazione, Università degli Studi di Perugia, Italy;Dip. Ing. Elettronica e dell'Informazione, Università degli Studi di Perugia, Italy
Venue:
GD'11 Proceedings of the 19th international conference on Graph Drawing
Year:
2011

Citing 4
Cited 1

On the Computational Complexity of Upward and Rectilinear Planarity Testing

SIAM Journal on Computing
Maximum upward planar subgraphs of embedded planar digraphs

Computational Geometry: Theory and Applications
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications
Upward Spirality and Upward Planarity Testing

SIAM Journal on Discrete Mathematics

Upward planarity testing via SAT

GD'12 Proceedings of the 20th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.