scientific article; zbMATH DE number 16300
From MaRDI portal
Publication:3972953
zbMATH Open0759.05055MaRDI QIDQ3972953FDOQ3972953
Authors: Neil Robertson, Paul Seymour 
Publication date: 26 June 1992
Title of this publication is not available (Why is that?)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38)
Cited In (33)
- Routing in undirected graphs with constant congestion
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
- The Directed Disjoint Shortest Paths Problem
- Elimination of local bridges
- Single-Sink Multicommodity Flow with Side Constraints
- A note on multiflows and treewidth
- Edge-disjoint odd cycles in 4-edge-connected graphs
- The disjoint paths problem in quadratic time
- Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph
- \(K_{a,k}\) minors in graphs of bounded tree-width
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- On the kernelization of split graph problems
- The extremal function for 3-linked graphs
- On the complexity of the bilevel minimum spanning tree problem
- Disjoint Paths—A Survey
- Some recent progress and applications in graph minor theory
- Subexponential parameterized algorithms
- Mengerian graphs: characterization and recognition
- Algorithms and obstructions for linear-width and related search parameters
- New Hardness Results for Routing on Disjoint Paths
- Finding disjoint paths with related path costs
- Combing a Linkage in an Annulus
- On shortest disjoint paths in planar graphs
- Kernelization of Two Path Searching Problems on Split Graphs
- Two disjoint negative cycles in a signed graph
- Searching for \(f\)-Hamiltonian circuits
- On the computational complexity of closest genome problems
- General vertex disjoint paths in series-parallel graphs
- Graph minors. II. Algorithmic aspects of tree-width
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972953)
