scientific article; zbMATH DE number 16300
From MaRDI portal
Publication:3972953
Recommendations
Cited in
(39)- Routing in undirected graphs with constant congestion
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
- Elimination of local bridges
- A note on multiflows and treewidth
- The Directed Disjoint Shortest Paths Problem
- Single-Sink Multicommodity Flow with Side Constraints
- Edge-disjoint odd cycles in 4-edge-connected graphs
- Lower bounds for approximate (\& exact) k-disjoint-shortest-paths
- 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
- Kernelization of two path searching problems on split graphs
- scientific article; zbMATH DE number 3858436 (Why is no real title available?)
- 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
- The extremal function for 3-linked graphs
- On the kernelization of split graph problems
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- Lower bounds for approximate (\& exact) \(k\)-\textsc{Disjoint-Shortest-Paths}
- Some recent progress and applications in graph minor theory
- Disjoint Paths—A Survey
- On the complexity of the bilevel minimum spanning tree problem
- Graph minors. XXII. Irrelevant vertices in linkage problems
- Subexponential parameterized algorithms
- Algorithms and obstructions for linear-width and related search parameters
- Mengerian graphs: characterization and recognition
- Finding disjoint paths with related path costs
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
- On shortest disjoint paths in planar graphs
- Improved approximation for node-disjoint paths in grids with sources on the boundary
- Combing a Linkage in an Annulus
- A lower bound on the tree-width of graphs with irrelevant vertices
- Searching for \(f\)-Hamiltonian circuits
- Two disjoint negative cycles in a signed graph
- On the computational complexity of closest genome problems
- Tight bounds for linkages in planar graphs
- General vertex disjoint paths in series-parallel graphs
- Graph minors. II. Algorithmic aspects of tree-width
- New hardness results for routing on disjoint paths
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)
