Cutwidth: obstructions and algorithmic aspects (Q1725643): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-018-0424-7
@@ Property / DOI: 10.1007/s00453-018-0424-7 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-018-0424-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2997810375
@@ Property / OpenAlex ID: W2997810375 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4792909
@@ Property / cites work: Q4792909 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
+Normal rank
@@ Property / cites work @@
+An $$O(\log \mathrm{OPT})$$ O ( log OPT ) -Approximation for Covering/Packing Minor Models of $$\theta _{r}$$ θ r
+Normal rank
@@ Property / cites work @@
+A well-quasi-order for tournaments
@@ Property / cites work: A well-quasi-order for tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Computation of Path-Width
@@ Property / cites work: Faster Computation of Path-Width / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-width and well-quasi-ordering in matroids and graphs.
+Normal rank
@@ Property / cites work @@
+Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
+Normal rank
@@ Property / cites work @@
+A weak immersion relation on graphs and its applications
+Normal rank
@@ Property / cites work @@
+Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
+Normal rank
@@ Property / cites work @@
+Cutwidth of Split Graphs and Threshold Graphs
@@ Property / cites work: Cutwidth of Split Graphs and Threshold Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-width, path-width, and cutwidth
@@ Property / cites work: Tree-width, path-width, and cutwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds on the size of obstructions and intertwines
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+Graph minors XXIII. Nash-Williams' immersion conjecture
+Normal rank
@@ Property / cites work @@
+Call routing and the ratcatcher
@@ Property / cites work: Call routing and the ratcatcher / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal acyclic forbidden minors for the family of graphs with bounded path-width
+Normal rank
@@ Property / cites work @@
+Cutwidth I: A linear time fixed parameter algorithm
+Normal rank
@@ Property / cites work @@
+Cutwidth II: Algorithms for partial w-trees of bounded degree
+Normal rank
@@ Property / cites work @@
+A Menger-like property of tree-width: The finite case
+Normal rank
@@ Property / cites work @@
+The structure of graphs not admitting a fixed immersion
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for the min-cut linear arrangement of trees
+Normal rank
@@ Property / DOI @@
+.1007/S00453-018-0424-7
@@ Property / DOI: 10.1007/S00453-018-0424-7 / rank @@
+Normal rank