A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
We describe a flow model that generalizes ordinary network flows the same way as stable matchings generalize the bipartite matching problem. We prove that there always exists a stable flow, generalize the lattice structure of stable marriages to stable flows and prove a flow extension of Pym's linking theorem.doi:10.3390/a7010001 fatcat:42gzqk3vybh6nonfzune5zivcq