Upward drawings of triconnected digraphs

A polynomial-time algorithm for testing if a triconnected directed graph has an upward drkwing is presented. An upward drkwing is a planar drkwing such that all the edges flow in a common direction (e.g., from bottom to top). The problem arises in the fields of automatic graph drkwing and ordered sets, and has been open for several years. The proposed algorithm is based on a new combinatorial characterization that maps the problem into a max-flow problem on a sparse network; the time complexity isO(n+r2), wheren is the number of vertices andr is the number of sources and sinks of the directed graph. If the directed graph has an upward drkwing, the algorithm allows us to construct one easily.

[1]  C. R. Platt,et al.  Planar lattices and planar graphs , 1976, J. Comb. Theory, Ser. B.

[2]  Roberto Tamassia,et al.  Incremental planarity testing , 1989, 30th Annual Symposium on Foundations of Computer Science.

[3]  Roberto Tamassia,et al.  Algorithms for Plane Representations of Acyclic Digraphs , 1988, Theor. Comput. Sci..

[4]  Roland Jégou,et al.  The diagram invariant problem for planar lattices , 1987 .

[5]  J. Urrutia,et al.  Representing orders on the plane by translating convex figures , 1988 .

[6]  M. N. Shanmukha Swamy,et al.  Graphs: Theory and Algorithms , 1992 .

[7]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[8]  Takao Nishizeki,et al.  Planar Graphs: Theory and Algorithms , 1988 .

[9]  William T. Trotter,et al.  The dimension of planar posets , 1977, J. Comb. Theory, Ser. B.

[10]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[11]  Roberto Tamassia,et al.  A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..

[12]  Norishige Chiba,et al.  A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees , 1985, J. Comput. Syst. Sci..

[13]  V. Vijayan,et al.  Geometry of planar graphs with angles , 1986, SCG '86.

[14]  Xuemin Lin,et al.  How to draw a directed graph , 1989, [Proceedings] 1989 IEEE Workshop on Visual Languages.

[15]  Giuseppe Di Battista,et al.  Bipartite Graphs, Upward Drawings, and Planarity , 1990, Inf. Process. Lett..

[16]  Carlo Batini,et al.  Automatic graph drawing and readability of diagrams , 1988, IEEE Trans. Syst. Man Cybern..

[17]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[18]  David Kelly.  Fundamentals of planar ordered sets , 1987, Discret. Math..

[19]  Anna Lubiw,et al.  Upward Planar Drawing of Single Source Acyclic Digraphs , 1991, Planar Graphs.

[20]  Seth M. Malitz,et al.  On the angular resolution of planar graphs , 1992, STOC '92.

[21]  H. Whitney.  Congruent Graphs and the Connectivity of Graphs , 1932 .

[22]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[23]  I. Rival.  Graphical Data Structures for Ordered Sets , 1989 .

[24]  Shimon Even,et al.  Graph Algorithms , 1979 .

[25]  Pierre Rosenstiehl,et al.  A Depth-First-Search Characterization of Planarity , 1982 .

[26]  C. Thomassen.  Planar acyclic oriented graphs , 1989 .

[27]  Ioannis G. Tollis,et al.  Area requirement and symmetry display of planar upward drawings , 1992, Discret. Comput. Geom..