scientific article; zbMATH DE number 16298
From MaRDI portal
Publication:3972951
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90)
Recommendations
Cited in
(58)- Modeling hypergraphs by graphs with the same mincut properties
- Approximations for the disjoint paths problem in high-diameter planar networks
- A note on the half-integral multiflow-problem restricted to minor-closed classes of graphs
- The parsimonious property of cut covering problems and its applications
- On return path packing.
- On extremal multiflows
- On multiflow lexicographics
- Eulerian disjoint paths problem in grid graphs is NP-complete
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
- NP-completeness of some edge-disjoint paths problems
- A note on packing paths in planar graphs
- Optimum path packing on wheels: The consecutive case
- On the fractionality of the path packing problem
- A polyhedral approach to an integer multicommodity flow problem
- On the maximum degree of path-pairable planar graphs
- Precoloring extension on unit interval graphs
- Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs
- On the kernelization of split graph problems
- The maximum integer multiterminal flow problem in directed graphs
- Edge-disjoint odd cycles in 4-edge-connected graphs
- Multiflow Feasibility: An Annotated Tableau
- The disjoint paths problem in quadratic time
- On shortest disjoint paths in planar graphs
- Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems
- All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs
- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover
- Kernelization of two path searching problems on split graphs
- Routing in grid graphs by cutting planes
- scientific article; zbMATH DE number 863470 (Why is no real title available?)
- Finding disjoint paths in split graphs
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
- The edge-disjoint paths problem is NP-complete for series-parallel graphs
- Solving the edge‐disjoint paths problem using a two‐stage method
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs
- The hardness of routing two pairs on one face
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Min-sum disjoint paths on subclasses of chordal graphs
- Kernels for the disjoint paths problem on subclasses of chordal graphs
- Kernels for the disjoint paths problem on subclasses of chordal graphs
- The parameterised complexity of integer multicommodity flow
- Rerouting planar curves and disjoint paths
- Lower bounds for approximate (\& exact) k-disjoint-shortest-paths
- Min-sum disjoint paths on subclasses of chordal graphs
- An exponential time parameterized algorithm for planar disjoint paths
- Minimal multicut and maximal integer multiflow: a survey
- Lower bounds for approximate (\& exact) \(k\)-\textsc{Disjoint-Shortest-Paths}
- Constant approximating disjoint paths on acyclic digraphs is W[1]-hard
- Packing paths in planar graphs
- A note on multiflows and treewidth
- Path packing and a related optimization problem
- Finding disjoint paths with related path costs
- Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs
- Induced disjoint paths problem in a planar digraph
- Disjoint paths in sparse graphs
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 Q3972951)
