Graph layering by promotion of nodes (Q2489908): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2005.05.023
+Normal rank
@@ Property / OpenAlex ID @@
+W2003825820
@@ Property / OpenAlex ID: W2003825820 / rank @@
+Normal rank
@@ Property / cites work @@
+Width-restricted layering of acyclic digraphs with consideration of dummy nodes
+Normal rank
@@ Property / cites work @@
+Optimal scheduling for two-processor systems
@@ Property / cites work: Optimal scheduling for two-processor systems / rank @@
+Normal rank
@@ Property / cites work @@
+An experimental comparison of four graph drawing algorithms.
+Normal rank
@@ Property / cites work @@
+Q3985344
@@ Property / cites work: Q3985344 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4422266
@@ Property / cites work: Q4422266 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3043701
@@ Property / cites work: Q3043701 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+NP-complete scheduling problems
@@ Property / cites work: NP-complete scheduling problems / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing Theory and Hierarchy Mapping
@@ Property / cites work: Crossing Theory and Hierarchy Mapping / rank @@
+Normal rank