Flows in networks : an algorithmic approach
M.Sc. (Mathematics) === In Chapter 1, we consider the relevant theory pertaining to graphs and digraphs that will be used in the study of flows in networks. Warshall’s algorithm for reachability is also considered since it will allow us to ascertain whether some paths exist in some instance. In Chap...
| Main Author: | |
|---|---|
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10210/8364 |