Bandwidth Minimization: An approximation algorithm for caterpillars (Q3979607): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the bandwidth minimization problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
+Normal rank
@@ Property / cites work @@
+The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
+Normal rank
@@ Property / cites work @@
+The Bandwidth of Caterpillars with Hairs of Length 1 and 2
+Normal rank
@@ Property / cites work @@
+Minimizing the bandwidth of sparse symmetric matrices
+Normal rank
@@ Property / cites work @@
+The bandwidth problem for graphs and matrices—a survey
+Normal rank
@@ Property / cites work @@
+Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
+Normal rank
@@ Property / cites work @@
+Bandwidth constraints on problems complete for polynomial time
+Normal rank
@@ Property / cites work @@
+The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3979607