Graph-theoretic approach to network analysis
Date of Publication
1977
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/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.
Abstract Format
html
Language
English
Format
Accession Number
TU02093
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
82 leaves
Keywords
Graph theory
Recommended Citation
Yu, M. S. (1977). Graph-theoretic approach to network analysis. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/15011
