Disjoint Paths—A Survey
From MaRDI portal
Publication:3679228
DOI10.1137/0606030zbMath0565.05045MaRDI QIDQ3679228
Publication date: 1985
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0606030
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05C38: Paths and cycles
Related Items
Constructive complexity, The vertex separation number of a graph equals its path-width, General vertex disjoint paths in series-parallel graphs, The existence of homeomorphic subgraphs in chordal graphs, The disjoint shortest paths problem, Algorithms and obstructions for linear-width and related search parameters, Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs, Searching forK3,3in linear time, Polynomial-time self-reducibility: theoretical motivations and practical results∗