Covering arrays avoiding forbidden edges

DOI10.1016/j.tcs.2009.07.057zbMath1183.68417OpenAlexW2130262632MaRDI QIDQ1040583

Brett Stevens, Lucia Moura, Eric Mendelsohn, Peter Danziger

Publication date: 25 November 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.057

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (5)

Combinatorial testing: using blocking to assign test cases for validating complex software systems ⋮ Non-uniform covering array with symmetric forbidden edge constraints ⋮ Hardness results for covering arrays avoiding forbidden edges and error-locating arrays ⋮ Algebraic techniques for covering arrays and related structures ⋮ Generalized covering designs and clique coverings

Cites Work

• Upper bounds on the edge clique cover number of a graph
• A simple lower bound on edge coverings by cliques
• Merging covering arrays and compressing multiple sequence alignments
• Problems and algorithms for covering arrays
• Sperner capacities
• Covering arrays on graphs
• Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
• Finding the Best CAFE Is NP-Hard
• A compilation of relations between graph invariants
• Vector sets for exhaustive testing of logic circuits
• A compilation of relations between graph invariants—supplement I
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• On the hardness of approximating minimization problems
• Covering arrays with mixed alphabet sizes
• Approximation Algorithms for the k-Clique Covering Problem
• Mixed covering arrays on graphs
• Algorithms to Locate Errors Using Covering Arrays
• Covering Arrays Avoiding Forbidden Edges
• The Representation of a Graph by Set Intersections
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Covering arrays avoiding forbidden edges