Algebraic flows in regular matroids
From MaRDI portal
Publication:1138993
DOI10.1016/0166-218X(80)90052-9zbMath0432.90087MaRDI QIDQ1138993
Publication date: 1980
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
ordered semigroupregular matroidsalgebraic matroid flowaugmenting circuit algorithmincremental matroidsreal-valued matroid flow
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Programming in abstract spaces (90C48) Combinatorial aspects of matroids and geometric lattices (05B35) Ordered semigroups and monoids (06F05)
Related Items
Max-balanced flows in oriented matroids ⋮ Multiple objective minimum cost flow problems: a review ⋮ Miu Cost Tensions ⋮ Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning ⋮ Decomposition of group flows in regular matroids ⋮ Optimal cocircuits in regular matroids and applications ⋮ On the generality of the greedy algorithm for solving matroid base problems ⋮ Algorithms for flows with parametric capacities ⋮ Greedy oriented flows ⋮ Characterizations of max-balanced flows ⋮ An analogue of Hoffman's circulation conditions for max-balanced flows
Cites Work
- Decomposition of regular matroids
- The matroids with the max-flow min-cut property
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Über reguläre Kettengruppen
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item