On the Cutwidth and the Topological Bandwidth of a Tree (Q3679205): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2097333141
@@ Property / OpenAlex ID: W2097333141 / rank @@
+Normal rank
@@ Property / cites work @@
+The bandwidth problem for graphs and matrices—a survey
+Normal rank
@@ Property / cites work @@
+Q3921277
@@ Property / cites work: Q3921277 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / 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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4103547
@@ Property / cites work: Q4103547 / rank @@
+Normal rank
@@ Property / cites work @@
+Topological Bandwidth
@@ Property / cites work: Topological Bandwidth / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the bandwidth minimization problem
+Normal rank