Packing non-returning A-paths
From MaRDI portal
Publication:2460627
DOI10.1007/s00493-007-0056-zzbMath1136.05060MaRDI 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
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C40: Connectivity
Related Items
Parameterized Complexity of $$(A,\ell )$$-Path Packing, A Weighted Linear Matroid Parity Algorithm, Packing non-zero \(A\)-paths via matroid matching, Tree metrics and edge-disjoint \(S\)-paths, Disjoint non-balanced \(A\)-paths in biased graphs, Parameterized complexity of \((A,\ell)\)-path packing, A fast algorithm for the path 2-packing problem, Packing non-returning \(A\)-paths algorithmically, 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