journal article
oaidoi:10.1016/j.disc.2003.11.029

Problems and algorithms for covering arrays

Authors
Publication date
6 July 2004
Publisher
Elsevier B.V.
Doi

    Abstract

    AbstractCovering 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

    Similar works

    Full text

    thumbnail-image

    Elsevier - Publisher Connector

    redirect
    oaidoi:10.1016/j.disc.2003.11.029
    Last time updated on 06/05/2017

    This paper was published in Elsevier - Publisher Connector .

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.