Approximation algorithms for digraph width parameters (Q476883): Difference between revisions

@@ Property / cites work @@
+O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for treewidth
@@ Property / cites work: Approximation algorithms for treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems
+Normal rank
@@ Property / cites work @@
+Directed path-width and monotonicity in digraph searching
+Normal rank
@@ Property / cites work @@
+The dag-width of directed graphs
@@ Property / cites work: The dag-width of directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+DAG-Width and Parity Games
@@ Property / cites work: DAG-Width and Parity Games / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
+Normal rank
@@ Property / cites work @@
+On treewidth approximations.
@@ Property / cites work: On treewidth approximations. / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Fugitive-search games on graphs and related parameters
+Normal rank
@@ Property / cites work @@
+Intractability of Clique-Width Parameterizations
@@ Property / cites work: Intractability of Clique-Width Parameterizations / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Minimum Weight Vertex Separators
+Normal rank
@@ Property / cites work @@
+On Digraph Width Measures in Parameterized Algorithmics
+Normal rank
@@ Property / cites work @@
+Are There Any Good Digraph Width Measures?
@@ Property / cites work: Are There Any Good Digraph Width Measures? / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking
+Normal rank
@@ Property / cites work @@
+Digraph measures: Kelly decompositions, games, and orderings
+Normal rank
@@ Property / cites work @@
+Directed tree-width
@@ Property / cites work: Directed tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Searching and pebbling
@@ Property / cites work: Searching and pebbling / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
+Normal rank
@@ Property / cites work @@
+On the algorithmic effectiveness of digraph decompositions and complexity measures
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+DAG-width
@@ Property / cites work: DAG-width / rank @@
+Normal rank
@@ Property / cites work @@
+Q2741376
@@ Property / cites work: Q2741376 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph searching and a min-max theorem for tree-width
+Normal rank