Packing non-returning A-paths
From MaRDI portal
Publication:2460627
DOI10.1007/s00493-007-0056-zzbMath1136.05060OpenAlexW2100674553MaRDI QIDQ2460627
Publication date: 12 November 2007
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-007-0056-z
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (12)
Parameterized Complexity of $$(A,\ell )$$-Path Packing ⋮ Packing non-zero \(A\)-paths via matroid matching ⋮ Tree metrics and edge-disjoint \(S\)-paths ⋮ A Weighted Linear Matroid Parity Algorithm ⋮ Packing non-returning \(A\)-paths algorithmically ⋮ A fast algorithm for the path 2-packing problem ⋮ Disjoint non-balanced \(A\)-paths in biased graphs ⋮ Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity ⋮ Algebraic Algorithms for Linear Matroid Parity Problems ⋮ Half-integrality, LP-branching, and FPT Algorithms ⋮ Euler Digraphs ⋮ Parameterized complexity of \((A,\ell)\)-path packing
This page was built for publication: Packing non-returning A-paths
