Graph-theoretic approach to network analysis
A network or a linear graph consists of a set of nodes and a set of arcs connecting various pairs of the nodes. In this study, the researcher discusses the various types of networks, namely, for the classical transportation problem, assignment problem, shortest route problem (Dijkstra's Ford�...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1977
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/15011 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | A network or a linear graph consists of a set of nodes and a set of arcs connecting various pairs of the nodes. In this study, the researcher discusses the various types of networks, namely, for the classical transportation problem, assignment problem, shortest route problem (Dijkstra's Ford's, Dantzig's and Bellman-Kalaba's algorithm), maximal flow algorithm, the minimal spanning tree problem and the Chinese Postman problem (Kwan's algorithm). There are illustrative problems which are solved using these algorithms. |
|---|