Skip to Main Content
N. PARAMESWARAN
Close
Follow your search
Access your saved searches in your account
Would you like to receive an alert when new items match your search?
Close Modal
Sort by
Journal Articles

A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS

Available to Purchase
S. SITHARAMA IYENGAR, JOHN FULLER, SIDARTH AMBARDAR, N. PARAMESWARAN
Journal: Kybernetes
Kybernetes (1986) 15 (2): 103–110.
https://doi.org/10.1108/eb005735
Published: 01 February 1986
View article titled, A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS
Open the PDF for A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS in another window
Add to Citation Manager for A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS
This Feature Is Available To Subscribers Only

or Create an Account

Close Modal
Close Modal