Pages that link to "Item:Q4877519"
From MaRDI portal
The following pages link to Upward Planar Drawing of Single-Source Acyclic Digraphs (Q4877519):
Displaying 31 items.
- Strip planarity testing for embedded planar graphs (Q524364) (← links)
- Maximum upward planar subgraphs of embedded planar digraphs (Q945947) (← links)
- Upward drawings of triconnected digraphs. (Q960528) (← links)
- Improving the running time of embedded upward planarity testing (Q991781) (← links)
- Volume requirements of 3D upward drawings (Q1011762) (← links)
- Algorithms for plane representations of acyclic digraphs (Q1124349) (← links)
- Every triangle-free planar graph has a planar upward drawing (Q1311415) (← links)
- Predicting nearly as well as the best pruning of a planar decision graph. (Q1853514) (← links)
- An SPQR-tree-like embedding representation for upward planarity (Q2206883) (← links)
- On the number of upward planar orientations of maximal planar graphs (Q2250457) (← links)
- Baxter posets (Q2318781) (← links)
- Computing maximum upward planar subgraphs of single-source embedded digraphs (Q2377381) (← 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)
- Upward planar graphs and their duals (Q2512656) (← links)
- Upward planarity testing in practice: SAT formulations and comparative study (Q2828203) (← links)
- Bitonic st-orderings for Upward Planar Graphs (Q2961518) (← links)
- (Q3138955) (← links)
- ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS (Q3520432) (← 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)
- Upward Planar Drawings and Switch-regularity Heuristics (Q5301392) (← links)
- Building Blocks of Upward Planar Digraphs (Q5301403) (← links)
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY (Q5493896) (← links)
- Multilevel Planarity (Q5856666) (← links)
- Confluent Hasse Diagrams (Q5895511) (← links)
- (Q6065397) (← 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)
