The NP-completeness of the bandwidth minimization problem (Q1223124): Difference between revisions

@@ Property / author @@
-Q1223123
@@ Property / author: Q1223123 / rank @@
-Normal rank
@@ Property / author @@
+Christos H. Papadimitriou
@@ Property / author: Christos H. Papadimitriou / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse matrices
@@ Property / cites work: Sparse matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing the bandwidth of sparse symmetric matrices
+Normal rank
@@ Property / cites work @@
+Note on minimizing the bandwidth of sparse, symmetric matrices
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / 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 / full work available at URL @@
+https://doi.org/10.1007/bf02280884
+Normal rank
@@ Property / OpenAlex ID @@
+W85690038
@@ Property / OpenAlex ID: W85690038 / rank @@
+Normal rank