A fast algorithm for the path 2-packing problem

DOI10.1007/s00224-008-9141-yzbMath1183.68716OpenAlexW2077595059MaRDI QIDQ2268342

Maxim A. Babenko

Publication date: 5 March 2010

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-008-9141-y

zbMATH Keywords

polynomial-time algorithmpath packing\(T\)-paths

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (2)

Discrete Convex Functions on Graphs and Their Algorithmic Applications ⋮ Algebraic Algorithms for Linear Matroid Parity Problems

Uses Software

• Algorithm 360

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
• Matroid matching and some applications
• Über die Maximalzahl kantendisjunkter A-Wege
• A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons
• A short proof of Mader's \(\mathcal S\)-paths theorem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Free multiflows in bidirected and skew-symmetric graphs
• Packing non-returning A-paths
• Packing non-returning \(A\)-paths algorithmically
• A Fast Algorithm for Path 2-Packing Problem
• A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
• On some connectivity properties of Eulerian graphs

This page was built for publication: A fast algorithm for the path 2-packing problem