Packing non-returning \(A\)-paths algorithmically

DOI10.1016/j.disc.2007.07.073zbMath1135.05060OpenAlexW2078338457MaRDI QIDQ2476288

Gyula Pap

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

zbMATH Keywords

matchingdisjoint paths

Mathematics Subject Classification ID

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 (7)

Parameterized Complexity of $$(A,\ell )$$-Path Packing ⋮ 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 ⋮ Parameterized complexity of \((A,\ell)\)-path packing

Cites Work

• Unnamed Item
• Packing non-zero \(A\)-paths in group-labelled graphs
• An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
• Matroid matching and some applications
• Über die Maximalzahl kreuzungsfreier H-Wege
• Packing non-returning A-paths
• Paths, Trees, and Flowers

This page was built for publication: Packing non-returning \(A\)-paths algorithmically