Computing directed pathwidth in \(O(1.89^n)\) time (Q300464): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-015-0015-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2344397418
@@ Property / OpenAlex ID: W2344397418 / rank @@
+Normal rank
@@ Property / cites work @@
+Directed path-width and monotonicity in digraph searching
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+A note on exact algorithms for vertex ordering problems on graphs
+Normal rank
@@ Property / cites work @@
+Treewidth and Pathwidth of Permutation Graphs
@@ Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Pathwidth and Treewidth of Cographs
@@ Property / cites work: The Pathwidth and Treewidth of Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth
+Normal rank
@@ Property / cites work @@
+Computing Tree-Depth Faster Than 2 n
@@ Property / cites work: Computing Tree-Depth Faster Than 2 n / rank @@
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Induced Subgraphs via Minimal Triangulations
+Normal rank
@@ Property / cites work @@
+On the pathwidth of chordal graphs
@@ Property / cites work: On the pathwidth of chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth of cocomparability graphs and a new order-theoretic parameter
+Normal rank
@@ Property / cites work @@
+Directed tree-width
@@ Property / cites work: Directed tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+The vertex separation number of a graph equals its path-width
+Normal rank
@@ Property / cites work @@
+Computing Directed Pathwidth in O(1.89 n ) Time
@@ Property / cites work: Computing Directed Pathwidth in O(1.89 n ) Time / rank @@
+Normal rank
@@ Property / cites work @@
+Min Cut is NP-complete for edge weighted trees
@@ Property / cites work: Min Cut is NP-complete for edge weighted trees / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Layouts in Submodular Systems
@@ Property / cites work: Linear Layouts in Submodular Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Pathwidth of Circular-Arc Graphs
@@ Property / cites work: Pathwidth of Circular-Arc Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Pathwidth Faster Than 2 n
@@ Property / cites work: Computing Pathwidth Faster Than 2 n / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Algorithm for Bounded Directed Pathwidth
+Normal rank
@@ Property / cites work @@
+Digraph searching, directed vertex separation and directed pathwidth
+Normal rank