Über die Maximalzahl kantendisjunkter A-Wege
From MaRDI portal
Publication:1236549
DOI10.1007/BF01226062zbMath0354.05042OpenAlexW2599087550MaRDI QIDQ1236549
Publication date: 1978
Published in: Archiv der Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01226062
Related Items (29)
Free multiflows in bidirected and skew-symmetric graphs ⋮ Graphs with large generalized (edge-)connectivity ⋮ Frames, $A$-Paths, and the Erdös--Pósa Property ⋮ Multiflows and disjoint paths of minimum total cost ⋮ Polyhedra related to undirected multicommodity flows ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Minimum weight \((T,d)\)-joins and multi-joins ⋮ The Generalized Terminal Backup Problem ⋮ Finding Maximum Edge-Disjoint Paths Between Multiple Terminals ⋮ The Lovász-Cherkassky theorem in countable graphs ⋮ On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ Matroid matching and some applications ⋮ Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees ⋮ Disjoint paths in graphs ⋮ Tree metrics and edge-disjoint \(S\)-paths ⋮ Primal-dual approximation algorithms for integral flow and multicut in trees ⋮ A fast algorithm for the path 2-packing problem ⋮ Disjoint paths in graphs. (Reprint) ⋮ On the Edge-Erdős–Pósa Property of Ladders ⋮ Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks ⋮ Über die Maximalzahl kreuzungsfreier H-Wege ⋮ Über ein graphentheoretisches Problem von T. Gallai ⋮ The Lovász-Cherkassky theorem in infinite graphs ⋮ On cycles through prescribed vertices in weakly separable graphs ⋮ Disjoint paths in a rectilinear grid ⋮ $K_4$-Subdivisions Have the Edge-Erdös--Pósa Property ⋮ On extremal multiflows ⋮ A linear programming formulation of Mader's edge-disjoint paths problem ⋮ Faster algorithms for half-integral T -Path packing
Cites Work
This page was built for publication: Über die Maximalzahl kantendisjunkter A-Wege
