Covering Arrays Avoiding Forbidden Edges

DOI10.1007/978-3-540-85097-7_28MaRDI QIDQ5505668zbMATH OpenOpenAlexFDO

Authors Peter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens

Publication date 27 January 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85097-7_28

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Applications of graph theory (05C90) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Covering arrays avoiding forbidden edges
• Covering arrays on graphs
• Non-uniform covering array with symmetric forbidden edge constraints
• Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
• Covering the edges with consecutive sets
• Covering arrays via set covers
• Covering edges in networks
• Covering the edges of a graph by circuits
• Covering the edges of a connected graph by paths
• Mixed covering arrays on graphs

Cited in

(6)

• Covering arrays avoiding forbidden edges
• A survey on the problems and algorithms for covering arrays via set covers
• Finding the best CAFE is NP-hard
• Non-uniform covering array with symmetric forbidden edge constraints
• Algorithms to Locate Errors Using Covering Arrays
• Hardness results for covering arrays avoiding forbidden edges and error-locating arrays

This page was built for publication: Covering Arrays Avoiding Forbidden Edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505668)