Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696): Difference between revisions

@@ Property / cites work @@
+Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
+Normal rank
@@ Property / cites work @@
+The bandwidth problem for graphs and matrices—a survey
+Normal rank
@@ Property / cites work @@
+Graphs with small bandwidth and cutwidth
@@ Property / cites work: Graphs with small bandwidth and cutwidth / rank @@
+Normal rank
@@ Property / cites work @@
+A remark on a problem of Harary
@@ Property / cites work: A remark on a problem of Harary / rank @@
+Normal rank
@@ Property / cites work @@
+Q4231911
@@ Property / cites work: Q4231911 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542524
@@ Property / cites work: Q4542524 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Results for Bandwidth Minimization
@@ Property / cites work: Complexity Results for Bandwidth Minimization / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Q5185900
@@ Property / cites work: Q5185900 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Bandwidth Minimization: An approximation algorithm for caterpillars
+Normal rank
@@ Property / cites work @@
+The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
+Normal rank
@@ Property / cites work @@
+Q4324980
@@ Property / cites work: Q4324980 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the bandwidth minimization problem
+Normal rank