The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete (Q1885051): Difference between revisions

@@ Property / cites work @@
+The Bandwidth of Caterpillars with Hairs of Length 1 and 2
+Normal rank
@@ Property / cites work @@
+The bandwidth problem for graphs and matrices—a survey
+Normal rank
@@ Property / cites work @@
+Complexity Results for Bandwidth Minimization
@@ Property / cites work: Complexity Results for Bandwidth Minimization / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal numberings and isoperimetric problems on graphs
+Normal rank
@@ Property / cites work @@
+Bandwidth and density for block graphs
@@ Property / cites work: Bandwidth and density for block graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Bandwidth of Interval Graphs
@@ Property / cites work: Computing the Bandwidth of Interval Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the minimum bandwidth of an interval graph
+Normal rank
@@ Property / cites work @@
+A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
+Normal rank
@@ Property / cites work @@
+On finding the minimum bandwidth of interval graphs
+Normal rank
@@ Property / cites work @@
+The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
+Normal rank
@@ Property / cites work @@
+Q3807243
@@ Property / cites work: Q3807243 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the bandwidth minimization problem
+Normal rank
@@ Property / cites work @@
+Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
+Normal rank
@@ Property / cites work @@
+An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs
+Normal rank