Network Algorithms

Course Name: 

Network Algorithms(CS915)

Programme: 

Ph.D

Credits (L-T-P): 

04(3-1-0)

Content: 

Algorithms for data aggregation in networks and distributed systems, algorithms for distributed search, algorithms for distributed configuration management, and algorithms for distributed trust and reputation schemes, overlay networks.

References: 

1. Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin,"Network flows,Theory, Algorithms, and Applications", Prentice-Haal, Englewood Cliffs, New Jersey, 1993.
2. Alexander Schrijver, "Combinatorial Optimization , Polyhedra and Efficiency" ,Springer-Verlag, 2003.
3. Christos H. Papadimitriou, Kenneth Steiglitz ," Combinatorial optimization : Algorithms and complexity" .

Department: 

Computer Science and Engineering
 

Contact us

P Santhi Thilagam
Associate Professor and Head
Department of CSE, NITK, Surathkal
P. O. Srinivasnagar, Mangalore - 575 025
Karnataka, India.

  • Hot line: +91-0824-2474060

Connect with us

We're on Social Networks. Follow us & get in touch.