Improving the running time of embedded upward planarity testing (Q991781): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2010.02.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2057903654
@@ Property / OpenAlex ID: W2057903654 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for plane representations of acyclic digraphs
+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 @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3154375
@@ Property / cites work: Q3154375 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Upward and Rectilinear Planarity Testing
+Normal rank
@@ Property / cites work @@
+SOFSEM 2005: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+Upward Planar Drawing of Single-Source Acyclic Digraphs
+Normal rank
@@ Property / cites work @@
+Fundamentals of planar ordered sets
@@ Property / cites work: Fundamentals of planar ordered sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q3219752
@@ Property / cites work: Q3219752 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:991781