A topological analysis of the complexity of computer programs with less than three binary branches
- 1 April 1981
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 16 (4) , 51-63
- https://doi.org/10.1145/988131.988137
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- A complexity measure based on nesting levelACM SIGPLAN Notices, 1981
- Measurement of program complexity by the pairACM SIGPLAN Notices, 1978
- An extension to the cyclomatic measure of program complexityACM SIGPLAN Notices, 1977