Upward drawings of triconnected digraphs.

DOI10.1007/BF01188716zbMath1211.68477MaRDI QIDQ960528

Giuseppe Liotta, Carlo Mannino, Giuseppe Di Battista, Paola Bertolazzi

Publication date: 21 December 2008

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

planarityhierarchical structureacyclic digraphsordered setsmax-flowautomatic graph drawing\textit{st}-digrams

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)

Related Items

Upward Planar Drawings with Three and More Slopes, Drawing two posets, Computing maximum upward planar subgraphs of single-source embedded digraphs, SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS, Advances on Testing C-Planarity of Embedded Flat Clustered Graphs, Upward planar drawings with three and more slopes, Quasi-upward planar drawings with minimum curve complexity, Upward planarity testing, Upward planar drawings with two slopes, Towards the Hanani-Tutte Theorem for Clustered Graphs, Upward planar drawings on the standing and the rolling cylinders, A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system, Upward Planarity Testing of Embedded Mixed Graphs, Testing upward planarity of partial 2-trees, \(c\)-planarity of embedded cyclic \(c\)-graphs, Bitonic st-orderings for Upward Planar Graphs, Parameterized approaches to orthogonal compaction, ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS, An SPQR-tree-like embedding representation for upward planarity, Upward and quasi-upward planarity testing of embedded mixed graphs, Extending upward planar graph drawings, Maximum upward planar subgraphs of embedded planar digraphs, On the number of upward planar orientations of maximal planar graphs, Strip planarity testing for embedded planar graphs, Computing upward topological book embeddings of upward planar digraphs, On the sphericity testing of single source digraphs, A better heuristic for area-compaction of orthogonal representations, Upward planar morphs, Improving the running time of embedded upward planarity testing, An Improved Upward Planarity Testing Algorithm and Related Applications, Upward planar morphs, A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs, Upward planar graphs and their duals, On the upward embedding on the torus, Computing k-modal embeddings of planar digraphs, Volume requirements of 3D upward drawings, Bounded Embeddings of Graphs in the Plane, Upward Planarity Testing in Practice, Combinatorial characterization of upward planarity, Multilevel Planarity, Radial Level Planarity with Fixed Embedding

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bipartite graphs, upward drawings, and planarity
• A linear algorithm for embedding planar graphs using PQ-trees
• A unified approach to visibility representations of planar graphs
• Fundamentals of planar ordered sets
• Representing orders on the plane by translating convex figures
• Algorithms for plane representations of acyclic digraphs
• Area requirement and symmetry display of planar upward drawings
• Planar graphs: Theory and algorithms
• Planar lattices and planar graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Planar acyclic oriented graphs
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• A Depth-First-Search Characterization of Planarity
• Efficient Planarity Testing
• Planar Lattices
• On the Angular Resolution of Planar Graphs