1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network flows: theory, algorithms, and applications.
2. Hardness of approximating problems on cubic graphs;Alimonti,1997
3. Network Model for Disaster Management;Arulselvan,2009
4. Detecting critical nodes in sparse graphs;Arulselvan;Comput. Oper. Res.,2009
5. A. Arulselvan, C.W. Commander, P.M. Pardalos, O. Shylo, Managing network risk via critical node identification, Risk Management in Telecommunication Networks, Springer.