Lattice flows in networks

Аннотация

We consider flows in networks analogous to numerical flows but such that values of arc capacities are elements of a lattice. We present an analog of the max-flow min-cut theorem. However, finding the value of the maximum flow for lattice flows is based on not this theorem but computations in the algebra of matrices over the lattice; in particular, the maximum flow value is found with the help of transitive closure of flow capacity functions. We show that there exists a correspondence between flows and solutions of special-form systems of linear equations over distributive lattices.