Covering Arrays with Row Limit

Covering Arrays with Row Limit

Show other versions (3)

Covering arrays with row limit, CARLs, are a new family of combinatorial objects which we introduce as a generalization of group divisible designs and covering arrays. In the same manner as their predecessors, CARLs have a natural application as combinatorial models for interaction test suites. A CA...

Full description

Bibliographic Details
Main Author: Francetic, Nevena
Other Authors: Mendelsohn, Eric
Language:en_ca
Published: 2012
Subjects:
group divisible designs
covering arrays
group divisible covering desings
graph covering problem
packing arrays
group divisible packing designs
0405
Online Access:http://hdl.handle.net/1807/34006

Internet

http://hdl.handle.net/1807/34006

Similar Items