Packing non-returning A-paths algorithmically

MaRDI QIDQ3576677zbMATH OpenFDO

Authors Gyula Pap

Publication date 30 July 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAE0128/0.html

zbMATH Keywords

A -pathsmatching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Packings and 2-packings of A-paths
• Packing non-returning A-paths
• Packing \(A\)-paths in group-labelled graphs via linear matroid parity
• Packing A-paths in group-labelled graphs via linear matroid parity
• Odd path packings

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