Packing non-returning \(A\)-paths algorithmically
From MaRDI portal
Publication:2476288
DOI10.1016/j.disc.2007.07.073zbMath1135.05060MaRDI QIDQ2476288
Publication date: 18 March 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.073
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Tree metrics and edge-disjoint \(S\)-paths, A fast algorithm for the path 2-packing problem, 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
Cites Work