Graph Theory: Flows, Matrices covers a number of topics in graph theory that are important in the major areas of application. It provides graph theoretic tools that can be readily and efficiently applied to problems in operational research, computer science, electrical engineering, and economics. Emphasizing didactic principles, the book derives theorems and proofs from a detailed analysis of the structure of graphs. The easy-to-follow algorithms can be readily converted to computer codes in high-level programming languages. Requiring knowledge of the basic concepts of graph theory and a familiarity with some simple results, the book also includes 100 exercises with solutions to help readers gain experience and 131 diagrams to aid in the understanding of concepts and proofs.
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
Für Beruf und Forschung
Professional
Maße
Höhe: 234 mm
Breite: 156 mm
Gewicht
ISBN-13
978-0-85274-222-8 (9780852742228)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
Structure of the graph model: The abstract graph. Geometrical realization of graphs. Components. Leaves. Blocks. Optimal flows: Maximal set of independent paths. The optimal assignment problem. The Hungarian method. Max flow-min cut. Dynamic flow. The mobilization problem. The synthesis of flow problems. Optical planning. The role of the critical path. Minimal cost transportation and flows. Graphs and matrices: The adjacency, incidence, circuit and cutset matrices. Linear electrical networks. Further matrices associated with graphs.
