Exact solutions for the construction of optimal length test sequences

DOI10.1016/0020-0190(93)90168-9zbMath0942.68642OpenAlexW1972359786MaRDI QIDQ1334626

Hasan Ural, Marion Rodrigues

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Testing Software Design Modeled by Finite-State Machines
• Matching, Euler tours and the Chinese postman
• A Method for the Design of Fault Detection Experiments

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