scientific article
From MaRDI portal
Publication:3972951
zbMath0741.05042MaRDI QIDQ3972951
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of graph theory (05C90) 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)
Related Items
A note on the half-integral multiflow-problem restricted to minor-closed classes of graphs, Edge-disjoint odd cycles in 4-edge-connected graphs, Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths, A tight relation between series-parallel graphs and bipartite distance hereditary graphs, A note on multiflows and treewidth, Eulerian disjoint paths problem in grid graphs is NP-complete, Path packing and a related optimization problem, An approximate max-flow min-cut relation for undirected multicommodity flow, with applications, On the kernelization of split graph problems, NP-completeness of some edge-disjoint paths problems, The maximum integer multiterminal flow problem in directed graphs, Finding disjoint paths with related path costs, The parsimonious property of cut covering problems and its applications, Optimum path packing on wheels: The consecutive case, All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs, Routing in grid graphs by cutting planes, On the fractionality of the path packing problem, On the maximum degree of path-pairable planar 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, The disjoint paths problem in quadratic time, A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs, On shortest disjoint paths in planar graphs, Multiflow Feasibility: An Annotated Tableau, Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems, Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs, Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover, The hardness of routing two pairs on one face, Kernelization of Two Path Searching Problems on Split Graphs, A polyhedral approach to an integer multicommodity flow problem, Finding disjoint paths in split graphs, Primal-dual approximation algorithms for integral flow and multicut in trees, The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs, Induced disjoint paths problem in a planar digraph, Disjoint paths in sparse graphs, Modeling hypergraphs by graphs with the same mincut properties, Minimal multicut and maximal integer multiflow: a survey, Precoloring extension on unit interval graphs, The edge-disjoint paths problem is NP-complete for series-parallel graphs, Approximations for the disjoint paths problem in high-diameter planar networks, An Approximation Algorithm for Fully Planar Edge-Disjoint Paths, Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs, On extremal multiflows, On multiflow lexicographics
