On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Fundamentals of planar ordered sets
Discrete Mathematics
Automatic graph drawing and readability of diagrams
IEEE Transactions on Systems, Man and Cybernetics
Algorithms for plane representations of acyclic digraphs
Theoretical Computer Science
Optimization
Bipartite graphs, upward drawings, and planarity
Information Processing Letters
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
SIAM Journal on Computing
Upward Planar Drawing of Single-Source AcyclicDigraphs
SIAM Journal on Computing
Computing Orthogonal Drawings with the Minimum Number of Bends
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
A New Minimum Cost Flow Algorithm with Applications to Graph Drawing
GD '96 Proceedings of the Symposium on Graph Drawing
Area Requirements for Drawing Hierarchically Planar Graphs
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Upward Planarity Testing of Outerplanar Dags
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Optimal Upward Planarity Testing of Single-Source Digraphs
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
On the Compuational Complexity of Upward and Rectilinear Planarity Testing
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
IEEE Transactions on Software Engineering
Orthogonal graph drawing with constraints
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The SPQR-tree data structure in graph drawing
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
| Hi-index | 0.00 |
In this paper we introduce the quasi-upward planar drawing convention and give a polynomial time algorithm for computing a quasi-upward planar drawing with the minimum number of bends within a given planar embedding. Further, we study the problem of computing quasi-upward planar drawings with the minimum number of bends of digraphs considering all the possible planar embeddings. The paper contains also experimental results about the proposed techniques.