Computing cyclomatic complexity with cubic flowgraphs

DOI10.1023/A:1011210102797MaRDI QIDQ2775682zbMATH OpenOpenAlexFDO

Authors Yongming Tang, Ali H. Dogru, Franz J. Kurfess, Murat M. Tanik

Publication date 28 February 2002

Published in Journal of Systems Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1011210102797

zbMATH Keywords

cubic flowgraphscyclomatic complexity

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• The complexity of cubical graphs
• scientific article; zbMATH DE number 3936535
• Computational complexity of covering cyclic graphs
• scientific article; zbMATH DE number 1305547
• scientific article; zbMATH DE number 3913694
• Computer observations of cycles in cubic graphs
• Complexity analysis by graph rewriting
• Cyclomatic complexity for generalized nets

This page was built for publication: Computing cyclomatic complexity with cubic flowgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2775682)