Flow Decomposition with Subpath Constraints
From MaRDI portal
Recommendations
- A practical fpt algorithm for F<scp>low</scp> D<scp>ecomposition</scp> and transcript assembly
- Safety and completeness in flow decompositions for RNA assembly
- Fast, flexible, and exact minimum flow decompositions via ILP
- Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
- Publication:3484606
Cited in
(6)- Safety and completeness in flow decompositions for RNA assembly
- Fast, flexible, and exact minimum flow decompositions via ILP
- Subdivision schemes, network flows and linear optimization
- Integral flow decomposition with minimum longest path length
- Feasibility of flow decomposition with subpath constraints in linear time
- Minimum flow decomposition in graphs with cycles using integer linear programming
This page was built for publication: Flow Decomposition with Subpath Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175893)