A Fast Algorithm for Path 2-Packing Problem

DOI10.1007/978-3-540-74510-5_10MaRDI QIDQ3499768zbMATH OpenOpenAlexFDO

Authors Maxim Babenko

Publication date 3 June 2008

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74510-5_10

Mathematics Subject Classification ID

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

Recommendations

• A fast algorithm for the path 2-packing problem
• Faster algorithms for half-integral T-path packing
• The path set packing problem
• STACS 2004
• An improved algorithm for packing T-paths in inner Eulerian networks

Cited in

(5)

• Maximum number of disjoint paths connecting specified terminals in a graph
• A fast algorithm for the path 2-packing problem
• An improved algorithm for packing T-paths in inner Eulerian networks
• A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
• Faster algorithms for half-integral T-path packing

This page was built for publication: A Fast Algorithm for Path 2-Packing Problem

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