Springer, 2013. – 229 p. – ISBN: 8132207491, 9788132207504The book has many important features which make it suitable for both undergraduate and postgraduate students in various branches of engineering and general and applied sciences. The important topics interrelating Mathematics & Computer Science are also covered briefly. The book is useful to readers with a wide range of backgrounds including Mathematics, Computer Science/Computer Applications and Operational Research. While dealing with theorems and algorithms, emphasis is laid on constructions which consist of formal proofs, examples with applications. Uptill, there is scarcity of books in the open literature which cover all the things including most importantly various algorithms and applications with examples. Keywords » Euler Graph and Hamiltonian Graph - Floyd-Warshall Algorithm - Ford-Fulkerson Algorithm - Graph Theory Textbook - Kuratowski Graphs - Prim Algorithm
Чтобы скачать этот файл зарегистрируйтесь и/или войдите на сайт используя форму сверху.