Optimal Upward Planarity Testing of Single-Source Digraphs
From MaRDI portal
Publication:4388867
DOI10.1137/S0097539794279626zbMath0911.68067MaRDI QIDQ4388867
Roberto Tamassia, Giuseppe Di Battista, Carlo Mannino, Paola Bertolazzi
Publication date: 10 May 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Parallel algorithms in computer science (68W10) Ordered sets (06A99)
Related Items
Upward Planar Drawings with Three and More Slopes ⋮ Drawing two posets ⋮ Computing maximum upward planar subgraphs of single-source embedded digraphs ⋮ Upward planar drawings with three and more slopes ⋮ Upward planarity testing ⋮ Upward planar drawings with two slopes ⋮ Upward planar drawings on the standing and the rolling cylinders ⋮ Clustered planarity with pipes ⋮ Universal slope sets for 1-bend planar drawings ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Algorithms for visualizing phylogenetic networks ⋮ Testing upward planarity of partial 2-trees ⋮ 1-Bend Upward Planar Drawings of SP-Digraphs ⋮ Visualizing multispecies coalescent trees: drawing gene trees inside species trees ⋮ Drawing (complete) binary tanglegrams ⋮ 1-bend upward planar slope number of SP-digraphs ⋮ 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 sphericity testing of single source digraphs ⋮ Comparing trees via crossing minimization ⋮ Upward three-dimensional grid drawings of graphs ⋮ Universal slope sets for upward planar drawings ⋮ Upward planar morphs ⋮ Improving the running time of embedded upward planarity testing ⋮ An Improved Upward Planarity Testing Algorithm and Related Applications ⋮ The Number of Plane Diagrams of a Lattice ⋮ Upward planar morphs ⋮ Universal slope sets for upward planar drawings ⋮ A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs ⋮ Confluent Hasse Diagrams ⋮ On the upward embedding on the torus ⋮ Volume requirements of 3D upward drawings ⋮ Upward Book Embeddings of st-Graphs ⋮ TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY ⋮ Multilevel Planarity
