On structured digraphs and program testing

DOI10.1109/TC.1981.6312158MaRDI QIDQ3902459zbMATH OpenFDO

Authors S. Louis Hakimi, Simeon C. Ntafos

Publication date 1981

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1981.6312158

zbMATH Keywords

D-chartsmust pairsNP-completepath coverssoftware reliabilitystructured programming

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(4)

• Clearing directed subgraphs by mobile agents. Variations on covering with paths
• Impossible pair constrained test path generation in a program
• On the computational complexity of path cover problems
• An efficient algorithm to construct disjoint path covers of DCell networks

This page was built for publication: On structured digraphs and program testing

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