ROM. Excluding students, others with an adequate knowledge of bioinformatics may bene t from this book since the accompanying Perl source code can be easily extended and deployed. Review of Graphs, Networks, and Algorithms (second edition)4 Author: Dieter Jungnickel Springer-Verlag Berlin Heidelberg 2005 Review written by William Fahle 0.1 Overview The eld of graph theory with the accompanying important problems such as ow and matching is maturing and growing. There is a need for a solid treatment of these subjects which is both introductory and comprehensive. This book seems to t that bill, beginning from the very basic de nitions of graph theory, quickly building a catalog of theorems, and ending with a complex suite of algorithms on graphs and networks. The early focus is mainly on graph theory, but the book includes discussions of ow, matroids, matching and paths to complete a course in combinatorial optimization. Applications are given for most of these subjects. At the end is a collection of NP-complete problems and an extensive bibliography. This text is suitable for graduate courses in combinatorics and graph theory, as well as for independent study and research by students, mathematicians, and professionals. It is a welcome addition
/lp/association-for-computing-machinery/review-of-graphs-networks-and-algorithms-second-edition-by-dieter-Mrig0EaUjA