Kernels for the disjoint paths problem on subclasses of chordal graphs
From MaRDI portal
Cites work
- Algorithms for finding an induced cycle in planar graphs and bounded genus graphs
- Almost polynomial hardness of node-disjoint paths in grids
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
- An exponential time parameterized algorithm for planar disjoint paths
- Approximating disjoint-path problems using packing integer programs
- Coloring triangle-free graphs on surfaces
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
- Finding disjoint paths in split graphs
- Finding edge-disjoint paths in partial \(k\)-trees
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XXII. Irrelevant vertices in linkage problems
- scientific article; zbMATH DE number 5899246 (Why is no real title available?)
- scientific article; zbMATH DE number 16298 (Why is no real title available?)
- scientific article; zbMATH DE number 1057879 (Why is no real title available?)
- scientific article; zbMATH DE number 6737879 (Why is no real title available?)
- Improved approximation for node-disjoint paths in grids with sources on the boundary
- Improved approximation for node-disjoint paths in planar graphs
- Irrelevant vertices for the planar disjoint paths problem
- Kernel bounds for disjoint cycles and disjoint paths
- Kernelization. Theory of parameterized preprocessing
- Kernels for the disjoint paths problem on subclasses of chordal graphs
- Linear-time certifying recognition algorithms and forbidden induced subgraphs
- New hardness results for routing on disjoint paths
- On approximating node-disjoint paths in grids
- On the Complexity of Timetable and Multicommodity Flow Problems
- On the Computational Complexity of Combinatorial Problems
- On the kernelization of split graph problems
- Parameterized algorithms
- Parameterized complexity of set-restricted disjoint paths on chordal graphs
- Planar disjoint paths, treewidth, and kernels
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Rooted routing in the plane
- The disjoint paths problem in quadratic time
- The edge-disjoint paths problem is NP-complete for series-parallel graphs
- The Lost Continent of Polynomial Time: Preprocessing and Kernelization
- The power of cut-based parameters for computing edge-disjoint paths
- The splittance of a graph
- TWO THEOREMS IN GRAPH THEORY
- Vertex disjoint paths on clique-width bounded graphs
- Well-partitioned chordal graphs
This page was built for publication: Kernels for the disjoint paths problem on subclasses of chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6885369)
