No label defined (Q4420181)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1964672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1964672 |
Statements
14 August 2003
0 references
directed graphs
0 references
network flow
0 references
0.94869447
0 references
0.9103746
0 references
0.9077106
0 references
0 references
0 references
0.89443326
0 references
A weighted directed graph is sometimes called a directed network or simply a net. Net theory is used in several areas : Electrical Engineering, Computer Science, Neural Networks, Communication and Transportation Networks, etc. This book presents a unified and rigorous treatment of net theory. The book contains many examples and algorithms. Student problems are not included. The basic terminology and properties of graphs and networks are discussed in Chapter 1. A discussion of the shortest directed path problem including algorithms is given in Chapter 2. In Chapter 3, the problem of maximizing flows in nets is treated. Some algorithms are also included. A discussion of minimum trees and some applications in the area of communication nets including various algorithms is presented in Chapter 4. In Chapter 5 several properties of net flows satisfying certain linear inequalities are established. Applications of these feasibility results are also given. Net flow results are applied to several subgraph problems of directed graphs in Chapter 6. In Chapter 7 the procedure of using nets, called signal-flow graphs, to solve a system of linear equations is covered. Several examples using electrical networks are presented. Several additional areas of application of net theory are given in Chapter 8. Many references are given at the end of each chapter.
0 references