Network flow and 2-satisfiability

@article{Feder1994NetworkFA,
  title={Network flow and 2-satisfiability},
  author={Tom{\'a}s Feder},
  journal={Algorithmica},
  year={1994},
  volume={11},
  pages={291-319}
}
We present two algorithms for network flow on networks with infinite capacities and finite integer supplies and demands. The first algorithm runs inO(m√K) time on networks withm edges, whereK=O(m2/log4 m) is the value of the optimal flow, and can also be applied to the capacitated case by lettingK be the sum of thefinite capacities alone. The second algorithm runs inO(wm logK) time for arbitraryK, where w is a new parameter, thewidth of the network. These algorithms as well as other uses of the… CONTINUE READING