Packing non-returning A-paths algorithmically

DOI10.1016/J.DISC.2007.07.073MaRDI QIDQ2476288zbMATH OpenOpenAlexFDO

Authors 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

disjoint pathsmatching

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)

Cites work

• An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
• scientific article; zbMATH DE number 3220175 (Why is no real title available?)
• Matroid matching and some applications
• Packing non-returning A-paths
• Packing non-zero \(A\)-paths in group-labelled graphs
• Paths, Trees, and Flowers
• Über die Maximalzahl kreuzungsfreier H-Wege

Cited in

(8)

• Parameterized complexity of \((A,\ell)\)-path packing
• 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
• Tree metrics and edge-disjoint \(S\)-paths
• Parameterized Complexity of $$(A,\ell )$$-Path Packing
• Tractability of packing vertex-disjoint a-paths under length constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476288)