Cyclomatic numbers do not measure complexity of unstructured programs

Oulsnam G. (1979) Cyclomatic numbers do not measure complexity of unstructured programs. Information Processing Letters, 9 5: 207-211. doi:10.1016/0020-0190(79)90070-X


Author Oulsnam G.
Title Cyclomatic numbers do not measure complexity of unstructured programs
Journal name Information Processing Letters   Check publisher's open access policy
ISSN 0020-0190
Publication date 1979-12-16
Sub-type Article (original research)
DOI 10.1016/0020-0190(79)90070-X
Open Access Status Not yet assessed
Volume 9
Issue 5
Start page 207
End page 211
Total pages 5
Subject 1703 Computational Theory and Mathematics
Keyword complexity measures
cyclomatic number
Flowgraphs
program equivalence
program transformations
Q-Index Code C1
Institutional Status Unknown

Document type: Journal Article
Sub-type: Article (original research)
Collection: Scopus Import - Archived
 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 4 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Tue, 13 Sep 2016, 14:41:52 EST by System User