A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs (Q3611857): Difference between revisions

@@ Property / cites work @@
+Q4411355
@@ Property / cites work: Q4411355 / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-upward planarity
@@ Property / cites work: Quasi-upward planarity / rank @@
+Normal rank
@@ Property / cites work @@
+Upward drawings of triconnected digraphs.
@@ Property / cites work: Upward drawings of triconnected digraphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Upward Planarity Testing of Single-Source Digraphs
+Normal rank
@@ Property / cites work @@
+Q3154375
@@ Property / cites work: Q3154375 / rank @@
+Normal rank
@@ Property / cites work @@
+SOFSEM 2005: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+Graph Drawing
@@ Property / cites work: Graph Drawing / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Upward and Rectilinear Planarity Testing
+Normal rank
@@ Property / cites work @@
+Upward Planar Drawing of Single-Source Acyclic Digraphs
+Normal rank
@@ Property / cites work @@
+On-line Planar Graph Embedding
@@ Property / cites work: On-line Planar Graph Embedding / rank @@
+Normal rank