Generating lower bounds for the linear arrangement problem (Q1891924): Difference between revisions

@@ Property / cites work @@
+Optimal Linear Ordering
@@ Property / cites work: Optimal Linear Ordering / rank @@
+Normal rank
@@ Property / cites work @@
+On optimal linear arrangements of trees
@@ Property / cites work: On optimal linear arrangements of trees / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-Terminal Network Flows
@@ Property / cites work: Multi-Terminal Network Flows / rank @@
+Normal rank
@@ Property / cites work @@
+An <i>r</i>-Dimensional Quadratic Placement Algorithm
+Normal rank
@@ Property / cites work @@
+Optimal Assignments of Numbers to Vertices
@@ Property / cites work: Optimal Assignments of Numbers to Vertices / rank @@
+Normal rank
@@ Property / cites work @@
+One-dimensional logic gate assignment and interval graphs
+Normal rank
@@ Property / cites work @@
+A Minimum Linear Arrangement Algorithm for Undirected Trees
+Normal rank