Optimal Upward Planarity Testing of Single-Source Digraphs
From MaRDI portal
Recommendations
- A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs
- Upward planarity testing of embedded mixed graphs
- Computing maximum upward planar subgraphs of single-source embedded digraphs
- Upward and quasi-upward planarity testing of embedded mixed graphs
- SOFSEM 2005: Theory and Practice of Computer Science
- Maximum upward planar subgraph of a single-source embedded digraph
- Algorithms – ESA 2004
- scientific article; zbMATH DE number 3871391
- Rolling upward planarity testing of strongly connected graphs
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
Cited in
(49)- On the upward embedding on the torus
- Volume requirements of 3D upward drawings
- Linear sphericity testing of 3-connected single source digraphs
- Upward planarity testing
- Upward planar drawings with three and more slopes
- 1-bend upward planar slope number of SP-digraphs
- An SPQR-tree-like embedding representation for upward planarity
- Computing maximum upward planar subgraphs of single-source embedded digraphs
- Clustered planarity with pipes
- Universal slope sets for 1-bend planar drawings
- Drawing (complete) binary tanglegrams
- Upward and quasi-upward planarity testing of embedded mixed graphs
- On the sphericity testing of single source digraphs
- Upward three-dimensional grid drawings of graphs
- 1-bend upward planar drawings of SP-digraphs
- Upward spirality and upward planarity testing
- scientific article; zbMATH DE number 3871391 (Why is no real title available?)
- 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 drawings on the standing and the rolling cylinders
- HOW TO DRAW A SERIES-PARALLEL DIGRAPH
- How to draw a series-parallel digraph
- Upward planar drawings with two slopes
- Upward book embeddings of st-graphs
- Building Blocks of Upward Planar Digraphs
- The Number of Plane Diagrams of a Lattice
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
- Multilevel planarity
- Upward Planar Drawings with Three and More Slopes
- Confluent Hasse Diagrams
- Universal slope sets for upward planar drawings
- Upward planar morphs
- Upward planar morphs
- Universal slope sets for upward planar drawings
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- Testing upward planarity of partial 2-trees
- Visualizing multispecies coalescent trees: drawing gene trees inside species trees
- On upward-planar L-drawings of graphs
- Upward and orthogonal planarity are W[1]-hard parameterized by treewidth
- Rectilinear-upward planarity testing of digraphs
- Rectilinear-upward planarity testing of digraphs
- Dynamic embeddings of dynamic single-source upward planar graphs
- Upward and rectilinear planarity are W[1]-hard parameterized by treewidth
- The price of upwardness
- Drawing two posets
- Maximum upward planar subgraphs of embedded planar digraphs
- Upward drawings of triconnected digraphs.
- Comparing trees via crossing minimization
- Improving the running time of embedded upward planarity testing
This page was built for publication: Optimal Upward Planarity Testing of Single-Source Digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388867)
