Updated second edition presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: how to mix known algorithms and create new ones. Features 153 black-and-white illustrations and 23 tables. Exercises, with answers at the ends of chapters.
Network Analysis and Synthesis: A Modern Systems Theory Approach by Brian D. O. Anderson, Sumeth Vongpanitlerd This comprehensive look at linear network analysis and synthesis explores state-space synthesis as well as analysis, employing modern systems theory to unite classical concepts of network theory. 1973 edition.
Combinatory Analysis by Percy A. MacMahon Account of combinatory analysis theorems shows their connections and unites them as parts of a general doctrine. Topics include symmetric functions, theory of number compositions, more. 1915, 1916, and 1920 editions.
