The following pages link to Disjoint Paths—A Survey (Q3679228):
Displaying 23 items.
- The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
- Forbidden minors characterization of partial 3-trees (Q913807) (← links)
- Structure and recognition of graphs with no 6-wheel subdivision (Q1031873) (← links)
- Nonconstructive advances in polynomial-time complexity (Q1098635) (← links)
- Constructive complexity (Q1182305) (← links)
- The vertex separation number of a graph equals its path-width (Q1198094) (← links)
- General vertex disjoint paths in series-parallel graphs (Q1208474) (← links)
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (Q1262768) (← links)
- The existence of homeomorphic subgraphs in chordal graphs (Q1372257) (← links)
- The disjoint shortest paths problem (Q1392552) (← links)
- Disjoint paths in graphs. III: Characterization (Q1407501) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- Disjoint paths in unions of tournaments (Q1719586) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- The theory of guaranteed search on graphs (Q2439841) (← links)
- Graphs with no 7-wheel subdivision (Q2449159) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- Fixed-Parameter Tractability, A Prehistory, (Q2908528) (← links)
- BFS Solution for Disjoint Paths in P Systems (Q3007713) (← links)
- Searching for<i>K</i><sub>3,3</sub>in linear time (Q3978382) (← links)
- Polynomial-time self-reducibility: theoretical motivations and practical results<sup>∗</sup> (Q4009694) (← links)
- Disjoint Paths in the Plane (Q4835451) (← links)
- Faster 2-Disjoint-Shortest-Paths Algorithm (Q5042231) (← links)
