Upward Planar Drawing of Single-Source Acyclic Digraphs
From MaRDI portal
Publication:4877519
DOI10.1137/S0097539792235906zbMath0844.68091WikidataQ56603427 ScholiaQ56603427MaRDI QIDQ4877519
Publication date: 18 August 1996
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items (21)
Computing maximum upward planar subgraphs of single-source embedded digraphs ⋮ Testing upward planarity of partial 2-trees ⋮ Bitonic st-orderings for Upward Planar Graphs ⋮ 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 ⋮ Unnamed Item ⋮ 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 ⋮ Upward three-dimensional grid drawings of graphs ⋮ Improving the running time of embedded upward planarity testing ⋮ An Improved Upward Planarity Testing Algorithm and Related Applications ⋮ A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs ⋮ Upward planar graphs and their duals ⋮ Confluent Hasse Diagrams ⋮ Volume requirements of 3D upward drawings ⋮ Baxter posets ⋮ TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY ⋮ Multilevel Planarity ⋮ Predicting nearly as well as the best pruning of a planar decision graph.
This page was built for publication: Upward Planar Drawing of Single-Source Acyclic Digraphs
