On structured digraphs and program testing
From MaRDI portal
Publication:3902459
DOI10.1109/TC.1981.6312158zbMath0454.68005MaRDI QIDQ3902459
S. Louis Hakimi, Simeon C. Ntafos
Publication date: 1981
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (4)
An efficient algorithm to construct disjoint path covers of DCell networks ⋮ 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
This page was built for publication: On structured digraphs and program testing
