Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
