The authors provide a comprehensive introduction to this topic and its many applications. Detailed solution procedures (usually in the form of an algorithm) are given to a wide range of central network problems. There is also a discussion of the time complexity of algorithms and the theory of NP-completeness. An early chapter provides the basic graph theory required for a study of networks. The presentation, clarity and arrangement of the material make it ideal for independent study as well as for use with conventional teaching. Algorithms are worked through, step-by-step, and problems (with fully worked solutions) are regularly provided to enable students to test and reinforce their learning.
"synopsis" may belong to another edition of this title.
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want