The disjoint paths problem in quadratic time (Q412168): Difference between revisions

@@ Property / author @@
-Bruce A. Reed
@@ Property / author: Bruce A. Reed / rank @@
-Normal rank
@@ Property / author @@
+Bruce A. Reed
@@ Property / author: Bruce A. Reed / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jctb.2011.07.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2115589427
@@ Property / OpenAlex ID: W2115589427 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q55934686
@@ Property / Wikidata QID: Q55934686 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+The all-or-nothing multicommodity flow problem
@@ Property / cites work: The all-or-nothing multicommodity flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity flow, well-linked terminals, and routing problems
+Normal rank
@@ Property / cites work @@
+Edge-disjoint paths in Planar graphs with constant congestion
+Normal rank
@@ Property / cites work @@
+Highly connected sets and the excluded grid theorem
+Normal rank
@@ Property / cites work @@
+Q4633818
@@ Property / cites work: Q4633818 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3972951
@@ Property / cites work: Q3972951 / rank @@
+Normal rank
@@ Property / cites work @@
+S-functions for graphs
@@ Property / cites work: S-functions for graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+Q3579485
@@ Property / cites work: Q3579485 / rank @@
+Normal rank
@@ Property / cites work @@
+A shorter proof of the graph minor algorithm
@@ Property / cites work: A shorter proof of the graph minor algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542573
@@ Property / cites work: Q4542573 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4231910
@@ Property / cites work: Q4231910 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximations for the disjoint paths problem in high-diameter planar networks
+Normal rank
@@ Property / cites work @@
+Q4633929
@@ Property / cites work: Q4633929 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the disjoint paths problem
@@ Property / cites work: On the complexity of the disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
+Normal rank
@@ Property / cites work @@
+AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH
+Normal rank
@@ Property / cites work @@
+Rooted routing in the plane
@@ Property / cites work: Rooted routing in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Q4352948
@@ Property / cites work: Q4352948 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm to find a separator in a graph excluding a minor
+Normal rank
@@ Property / cites work @@
+Q4273851
@@ Property / cites work: Q4273851 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3972953
@@ Property / cites work: Q3972953 / 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 @@
+Graph minors. XVI: Excluding a non-planar graph
@@ Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XXI. graphs with unique linkages
@@ Property / cites work: Graph minors. XXI. graphs with unique linkages / rank @@
+Normal rank
@@ Property / cites work @@
+Quickly excluding a planar graph
@@ Property / cites work: Quickly excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint paths in graphs
@@ Property / cites work: Disjoint paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3707420
@@ Property / cites work: Q3707420 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the 2-disjoint paths problem in nearly linear time
+Normal rank
@@ Property / cites work @@
+Improved Algorithms for the 2-Vertex Disjoint Paths Problem
+Normal rank
@@ Property / cites work @@
+-linked graphs
@@ Property / cites work: 2-linked graphs / rank @@
+Normal rank