Heuristics for matrix bandwidth reduction (Q858330): Difference between revisions

@@ Property / cites work @@
+Q5674871
@@ Property / cites work: Q5674871 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4717930
@@ Property / cites work: Q4717930 / rank @@
+Normal rank
@@ Property / cites work @@
+The bandwidth problem for graphs and matrices—a survey
+Normal rank
@@ Property / cites work @@
+Q4848765
@@ Property / cites work: Q4848765 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4261041
@@ Property / cites work: Q4261041 / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy randomized adaptive search procedures
@@ Property / cites work: Greedy randomized adaptive search procedures / 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 @@
+An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
+Normal rank
@@ Property / cites work @@
+A Comparison of Several Bandwidth and Profile Reduction Algorithms
+Normal rank
@@ Property / cites work @@
+Q3664299
@@ Property / cites work: Q3664299 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471904
@@ Property / cites work: Q4471904 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for reducing the bandwidth and profile of a sparse matrix
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the bandwidth minimization problem
+Normal rank
@@ Property / cites work @@
+GRASP and path relinking for the matrix bandwidth minimization.
+Normal rank