This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
November 1978 (vol. 4 no. 6)
pp. 521-525
U.R. Kodres, Naval Postgraduate School
This paper points out the abstract similarities between problems arising in programming, discrete systems analysis in engineering, and network flow problems in operations research. The highly developed techniques of analyzing discrete systems of two terminal elements in electrical engineering become applicable to analyzing the complexity and execution time of computer programs.
Index Terms:
programming, Basis, complexity, control flow, discrete systems, execution times, flowgraph, graph theory, independence, linear, network flow
Citation:
U.R. Kodres, "Discrete Systems and Flowcharts," IEEE Transactions on Software Engineering, vol. 4, no. 6, pp. 521-525, Nov. 1978, doi:10.1109/TSE.1978.234138
Usage of this product signifies your acceptance of the Terms of Use.