Title of article
Problems and algorithms for covering arrays Original Research Article
Author/Authors
Alan Hartman، نويسنده , , Leonid Raskin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
8
From page
149
To page
156
Abstract
Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have applications in the realm of software testing. In this paper we raise several new problems motivated by these applications and discuss algorithms for their solution.
Keywords
Orthogonal array , Covering array
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
948961
Link To Document