1. Joe Prathap, P.M., Brindha, G.R.:“An Innovative TESOR Algorithm for Perfect Routing”, International conference on signal processing, communication, computing and network technologies (NCACNSP) 2011.
2. Joe Prathap, P.M., Brindha, G.R.:“A Revised TESOR Algorithm for Perfect Routing,” First International conference Computer Science, Engineering and Information Technology (CCSEIT) 2011.[Accepted for Pubication].
3. On Shortest Path Representation,” Budapest Univ. of Technol. & Econ., Budapest, IEEE, vol.15;Retvari;issue 6, Dec. pp 1293, [Networking IEEE/ACM Transactions].,2007
4. Zhu, S., Huang, G.M.: “A new parallel and distributed shortest path algorithm for hierarchically clustered data networks”, Nortel Inc., Richardson, TX, IEEE, vol 9, issue 9, September 1998.[Parallel and Distributed Systems, IEEE Transactions].
5. Garng Huang Shan, Zhu., :, “A., new distributed shortest path algorithm for hierarchically clustered data networks”, Dept., of, Electr., Eng., Texas, A&M., Univ., College Station, T. X., I. E. E. E., vol 3, 21-23 Jun 1995 [American Control Conference Proceedings]. 1995.