Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results (Q4845143): Difference between revisions

@@ Property / cites work @@
+Characterization and Recognition of Partial 3-Trees
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Linear-time computation of optimal subgraphs of decomposable graphs
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for finding tree-decompositions of small treewidth
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+Polyhedral Characterization of Discrete Dynamic Programming
+Normal rank
@@ Property / cites work @@
+Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
+Normal rank
@@ Property / cites work @@
+Q3684139
@@ Property / cites work: Q3684139 / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Solution to the Undirected Two Paths Problem
+Normal rank
@@ Property / cites work @@
+Steiner trees, partial 2–trees, and minimum IFI networks
+Normal rank
@@ Property / cites work @@
+Q3740231
@@ Property / cites work: Q3740231 / rank @@
+Normal rank