The Max-Flow Min-Cut theorem for countable networks
From MaRDI portal
(Redirected from Publication:618031)
Abstract: We prove a strong version of the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are "orthogonal" to each other, in the sense that the flow saturates the cut and is zero on the reverse cut. If the network does not contain infinite trails then this flow can be chosen to be mundane, i.e. to be a sum of flows along finite paths. We show that in the presence of infinite trails there may be no orthogonal pair of a cut and a mundane flow. We finally show that for locally finite networks there is an orthogonal pair of a cut and a flow that satisfies Kirchhoff's first law also for ends.
Recommendations
- A measure-theoretical max-flow-min-cut problem
- A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
- Max-flow min-cut theorem in an anisotropic network
- On Gale's feasibility theorem for certain infinite networks
- scientific article; zbMATH DE number 997341
Cites work
Cited in
(19)- A greedy algorithm for finding maximum spanning trees in infinite graphs
- The max-flow min-cut property and \(\pm 1\)-resistant sets
- A measure-theoretical max-flow-min-cut problem
- Relational -liftings for differential privacy
- Random walks in Dirichlet environment: an overview. Dedicated to Dominique Bakry on the occasion of his 60th birthday
- On packing and covering polyhedra in infinite dimensions
- A theory of composition for differential obliviousness
- (Towards a) statistical probabilistic lazy lambda calculus
- Minimum spanning trees in infinite graphs: theory and algorithms
- Random walks in random Dirichlet environment are transient in dimension \(d \geq 3\)
- Borel circle squaring
- Locally finite graphs with ends: A topological approach. II: Applications
- A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
- A simplex method for uncapacitated pure-supply infinite network flow problems
- The Lovász-Cherkassky theorem in infinite graphs
- Probabilistic functions and cryptographic oracles in higher order logic
- scientific article; zbMATH DE number 3860851 (Why is no real title available?)
- Algebraic flow theory of infinite graphs
- A general framework for probabilistic characterizing formulae
This page was built for publication: The Max-Flow Min-Cut theorem for countable networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q618031)
