Topological Bandwidth (Q3691781): Difference between revisions

@@ Property / author @@
-Q197784
@@ Property / author: Q197784 / rank @@
-Normal rank
@@ Property / author @@
-Ivan Hal Sudborough
@@ Property / author: Ivan Hal Sudborough / rank @@
-Normal rank
@@ Property / author @@
+Christos H. Papadimitriou
@@ Property / author: Christos H. Papadimitriou / rank @@
+Normal rank
@@ Property / author @@
+Ivan Hal Sudborough
@@ Property / author: Ivan Hal Sudborough / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1137/0606044
@@ Property / full work available at URL: https://doi.org/10.1137/0606044 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4248251133
@@ Property / OpenAlex ID: W4248251133 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5674871
@@ Property / cites work: Q5674871 / 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 @@
+On the Cutwidth and the Topological Bandwidth of a Tree
+Normal rank
@@ Property / cites work @@
+Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
+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 @@
+Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
+Normal rank
@@ Property / cites work @@
+Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
+Normal rank
@@ Property / cites work @@
+Black-white pebbles and graph separation
@@ Property / cites work: Black-white pebbles and graph separation / rank @@
+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 @@
+On eliminating nondeterminism from Turing machines which use less than logarithm worktape space
+Normal rank
@@ Property / cites work @@
+One-dimensional logic gate assignment and interval graphs
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the bandwidth minimization problem
+Normal rank
@@ Property / cites work @@
+On arithmetic expressions and trees
@@ Property / cites work: On arithmetic expressions and trees / rank @@
+Normal rank
@@ Property / cites work @@
+Bandwidth and pebbling
@@ Property / cites work: Bandwidth and pebbling / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Bandwidth constraints on problems complete for polynomial time
+Normal rank