Upward and quasi-upward planarity testing of embedded mixed graphs ?
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.
quasi-upward planarity upward planarity mixed graphs graph drawing