Algebraic flows in regular matroids
From MaRDI portal
Cites work
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- Decomposition of regular matroids
- scientific article; zbMATH DE number 3133252 (Why is no real title available?)
- scientific article; zbMATH DE number 3735581 (Why is no real title available?)
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3222127 (Why is no real title available?)
- scientific article; zbMATH DE number 3227800 (Why is no real title available?)
- scientific article; zbMATH DE number 3290885 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- scientific article; zbMATH DE number 3365043 (Why is no real title available?)
- The matroids with the max-flow min-cut property
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Über reguläre Kettengruppen
Cited in
(11)- Decomposition of group flows in regular matroids
- Optimal cocircuits in regular matroids and applications
- Characterizations of max-balanced flows
- Max-balanced flows in oriented matroids
- Greedy oriented flows
- An analogue of Hoffman's circulation conditions for max-balanced flows
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
- Miu Cost Tensions
- Algorithms for flows with parametric capacities
- On the generality of the greedy algorithm for solving matroid base problems
- Multiple objective minimum cost flow problems: a review
This page was built for publication: Algebraic flows in regular matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1138993)