A fast algorithm for the path 2-packing problem
From MaRDI portal
Publication:2268342
DOI10.1007/S00224-008-9141-YzbMATH Open1183.68716OpenAlexW2077595059MaRDI QIDQ2268342FDOQ2268342
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Title not available (Why is that?)
- Matroid matching and some applications
- Packing non-returning A-paths
- An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
- Über die Maximalzahl kantendisjunkter A-Wege
- Free multiflows in bidirected and skew-symmetric graphs
- Title not available (Why is that?)
- 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
- Packing non-returning \(A\)-paths algorithmically
- On some connectivity properties of Eulerian graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
- A Fast Algorithm for Path 2-Packing Problem
Cited In (7)
- A fast implementation for the 2D/3D box placement problem
- Algebraic algorithms for linear matroid parity problems
- Algorithm to find a maximum 2-packing set in a cactus
- Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
- Discrete Convex Functions on Graphs and Their Algorithmic Applications
- A Fast Algorithm for Path 2-Packing Problem
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing}
Uses Software
This page was built for publication: A fast algorithm for the path 2-packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268342)
