References
- [1] Ahuja,R., Magnanti,T. and Orlin,J., Network Flows. Theory, algorithms and applications, Prentice Hall, Inc., Englewood Cliffs, New Jersey, 1993
- [2] Ahuja,R., Stein,C., Tarjan,R.E., Orlin, J. Improved algorithms for bipar- tite network ow, SIAM Journal on Computing, 23(5), 906-93310.1137/S0097539791199334
- [3] Bichot,C-E., Siarry,P., Graph Partitioning: Optimisation and Applications, ISTE Wiley, 2011
- [4] Goldberg,A., Two-Level Push-Relabel Algorithm for the Maximum Flow Problem Lecture Notes in Computer Science, Springer, vol.5564(2009), 212-22510.1007/978-3-642-02158-9_19
- [5] Parpalea,M., Min-Max algorithm for the parametric ow problem, Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics, Vol.3, 52 (2010), 191-198
- [6] Ruhe,G., Complexity Results for Multicriterial and Parametric Network Flows Using a Pathological Graph of Zadeh, Zeitschrift fur Oper. Res. 32 (1988), 9-2710.1007/BF01920568
- [7] Sângeorzan,L., Parpalea,M., Parpalea,M.M., Partitioning Preflow-pull Algorithm for the Parametric Net-work Flow Problem a Linguistic Rule- based Constraints Optimisation Approach, Recent Advances in Neural Networks, Fuzzy Systems and Evolutionary Computing, Proceedings of the 11th WSEAS International Conference on Neural Networks, Iasi, Romania, 2010, 111-116
- [8] Treeratpituk,P., Khabsa,M., Giles,C.L., Graph-based Approach to Automatic Taxonomy Generation (GraBTex), CoRR, arXiv:1307.1718 (2014), [cs.IR]