An Approach for Mixed Upward Planarization

In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization of the planarization problem for undirected graphs and is motivated by several applications in graph drawing. We present a heuristic approach for this problem which provides good quality and reasonable running time in practice, even for large graphs. This planarization method combined with a graph drawing algorithm for upward planar graphs can be seen as a real alternative to the well known Sugiyama algorithm. Communicated by Giuseppe Liotta and Ioannis G. Tollis: submitted October 2001; revised December 2002. Research supported in part by DFG-Grant Ka812/8-1 

• Type: Conference
• Year: 2001
• Where: WADS
• Authors: Markus Eiglsperger, Michael Kaufmann
• Keywords: Algorithms, Graph Drawing, Mixed Upward Planarization, Planarization Problem, WADS 2001