A Layout algorithm for data flow diagrams
IEEE Transactions on Software Engineering
On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
The Unified Modeling Language user guide
The Unified Modeling Language user guide
An analysis of some heuristics for the maximum planar subgraph problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Orthogonal graph drawing with constraints
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Algorithm 360: shortest-path forest with topological ordering [H]
Communications of the ACM
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Level Planarity Testing in Linear Time
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
On the Compuational Complexity of Upward and Rectilinear Planarity Testing
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Upward planarity testing via SAT
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
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 heuristical 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 wellknown Sugiyama algorithm.