Exact solutions for the construction of optimal length test sequences

DOI10.1016/0020-0190(93)90168-9MaRDI QIDQ1334626zbMATH OpenOpenAlexFDO

Authors Marion Rodrigues, Hasan Ural

Publication date 25 September 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(93)90168-9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Fault detection; testing in circuits and networks (94C12)

Cites work

• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• scientific article; zbMATH DE number 3598362 (Why is no real title available?)
• scientific article; zbMATH DE number 3231691 (Why is no real title available?)
• A Method for the Design of Fault Detection Experiments
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Graph theory with applications
• Matching, Euler tours and the Chinese postman
• Testing Software Design Modeled by Finite-State Machines

This page was built for publication: Exact solutions for the construction of optimal length test sequences

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