Approximating the bandwidth for asteroidal triple-free graphs (Q6102320): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-60313-1_161
+Normal rank
@@ Property / OpenAlex ID @@
+W1618256705
@@ Property / OpenAlex ID: W1618256705 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+The Bandwidth of Caterpillars with Hairs of Length 1 and 2
+Normal rank
@@ Property / cites work @@
+Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract)
+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 @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
+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 @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the bandwidth for asteroidal triple-free 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 @@
+A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the bandwidth minimization problem
+Normal rank
@@ Property / cites work @@
+Bandwidth of theta graphs with short paths
@@ Property / cites work: Bandwidth of theta graphs with short paths / rank @@
+Normal rank
@@ Property / cites work @@
+Q5588432
@@ Property / cites work: Q5588432 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+On Comparability and Permutation Graphs
@@ Property / cites work: On Comparability and Permutation Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs
+Normal rank
@@ Property / cites work @@
+On the Probable Performance of Heuristics for Bandwidth Minimization
+Normal rank