Article ID Journal Published Year Pages File Type
434431 Theoretical Computer Science 2014 15 Pages PDF
Abstract

Mixed graphs have both directed and undirected edges and have received considerable attention in the literature. We study two upward planarity testing problems for embedded mixed graphs, give some NP-hardness results, and describe Integer Linear Programming techniques to solve them. Experiments show the efficiency of our approach.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Upward and quasi-upward planarity testing of embedded mixed graphs
Authors
, , ,