Narsingh Deo

From Bharatpedia, an open encyclopedia
Information red.svg
Scan the QR code to donate via UPI
Dear reader, We need your support to keep the flame of knowledge burning bright! Our hosting server bill is due on June 1st, and without your help, Bharatpedia faces the risk of shutdown. We've come a long way together in exploring and celebrating our rich heritage. Now, let's unite to ensure Bharatpedia continues to be a beacon of knowledge for generations to come. Every contribution, big or small, makes a difference. Together, let's preserve and share the essence of Bharat.

Thank you for being part of the Bharatpedia family!
Please scan the QR code on the right click here to donate.

0%

   

transparency: ₹0 raised out of ₹100,000 (0 supporter)


Narsingh Deo is a professor and Charles N. Millican Endowed Chair of the Department of Computer Science, University of Central Florida. He received his Ph.D. for his dissertation 'Topological Analysis of Active Networks and Generalization of Hamiltonian tree' from Northwestern University, IL., in 1965; S. L. Hakimi was his adviser. Deo was professor at the Indian Institute of Technology, Kanpur.

Books[edit]

  • Graph Theory with Application to Engineering and Computer Science, Prentice-Hall, Englewood Cliffs, N.J., 1974, 480 pages.
  • Combinatorial Algorithms: Theory and Practice (with E.M. Reingold and J. Nievergelt), Prentice-Hall, Englewood Cliffs, NJ., 1977, 433 pages.
  • System Simulation with Digital Computers, Prentice-Hall, Englewood Cliffs, N.J., 1979, 200 pages.
  • Discrete Optimization Algorithms: With Pascal Programs (with M.M. Syslo and J. S. Kowalik), Prentice-Hall, Englewood Cliffs, N.J., 1983, 542 pages.

References[edit]