dc.contributor.author | Hu, Chinsyh | |
dc.date.accessioned | 2014-12-17T20:26:12Z | |
dc.date.available | 2014-12-17T20:26:12Z | |
dc.date.issued | 1990-12-01 | |
dc.identifier.uri | https://hdl.handle.net/11244/13950 | |
dc.description.abstract | Program complexity can be measured based on graph-theoretic metrics such as cyclomatic number, track number, normal number, etc. This thesis explores the question of changing the directions of the edges on a flow graph and its impact on the graph-theoretic complexity metrics. Both structured and unstructured flow graphs are considered in this study. | |
dc.format | application/pdf | |
dc.language | en_US | |
dc.publisher | Oklahoma State University | |
dc.rights | Copyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material. | |
dc.title | Sensitivity of Graph-theoretic Metrics to Edge Directions for Structured and Unstructured Programs� | |
dc.type | text | |
osu.filename | Thesis-1990-H8735s.pdf | |
osu.accesstype | Open Access | |
dc.description.department | Computer Science | |
dc.type.genre | Thesis | |