Pages that link to "Item:Q4388867"
From MaRDI portal
The following pages link to Optimal Upward Planarity Testing of Single-Source Digraphs (Q4388867):
Displaying 43 items.
- Upward planar drawings on the standing and the rolling cylinders (Q390362) (← links)
- Drawing two posets (Q831842) (← links)
- Maximum upward planar subgraphs of embedded planar digraphs (Q945947) (← links)
- Upward drawings of triconnected digraphs. (Q960528) (← links)
- Comparing trees via crossing minimization (Q988574) (← links)
- Improving the running time of embedded upward planarity testing (Q991781) (← links)
- On the upward embedding on the torus (Q1010987) (← links)
- Volume requirements of 3D upward drawings (Q1011762) (← links)
- Linear sphericity testing of 3-connected single source digraphs (Q1758790) (← links)
- Upward planarity testing (Q1904391) (← links)
- Upward planar drawings with three and more slopes (Q2151439) (← links)
- Algorithms for visualizing phylogenetic networks (Q2192379) (← links)
- 1-bend upward planar slope number of SP-digraphs (Q2206732) (← links)
- An SPQR-tree-like embedding representation for upward planarity (Q2206883) (← links)
- Computing maximum upward planar subgraphs of single-source embedded digraphs (Q2377381) (← links)
- Clustered planarity with pipes (Q2414866) (← links)
- Universal slope sets for 1-bend planar drawings (Q2414867) (← links)
- Drawing (complete) binary tanglegrams (Q2428677) (← links)
- Upward and quasi-upward planarity testing of embedded mixed graphs (Q2437763) (← links)
- On the sphericity testing of single source digraphs (Q2483398) (← links)
- Upward three-dimensional grid drawings of graphs (Q2503149) (← links)
- 1-Bend Upward Planar Drawings of SP-Digraphs (Q2961509) (← links)
- (Q3338271) (← links)
- An Improved Upward Planarity Testing Algorithm and Related Applications (Q3605509) (← links)
- A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs (Q3611857) (← links)
- How to draw a series-parallel digraph (Q5056147) (← links)
- Upward planar drawings with two slopes (Q5084713) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Building Blocks of Upward Planar Digraphs (Q5301403) (← links)
- The Number of Plane Diagrams of a Lattice (Q5445327) (← links)
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY (Q5493896) (← links)
- Multilevel Planarity (Q5856666) (← links)
- Upward Planar Drawings with Three and More Slopes (Q5886036) (← links)
- Confluent Hasse Diagrams (Q5895511) (← links)
- Extending upward planar graph drawings (Q5896867) (← links)
- Universal slope sets for upward planar drawings (Q5915938) (← links)
- Upward planar morphs (Q5915939) (← links)
- Upward planar morphs (Q5918180) (← links)
- Universal slope sets for upward planar drawings (Q5918782) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
- Testing upward planarity of partial 2-trees (Q6117044) (← links)
- On upward-planar L-drawings of graphs (Q6616232) (← links)
- Upward and orthogonal planarity are W[1]-hard parameterized by treewidth (Q6618262) (← links)
