A greedy algorithm to construct covering arrays using a graph representation

DOI10.1016/j.ins.2018.10.048zbMath1442.68186OpenAlexW2898691066WikidataQ129015606 ScholiaQ129015606MaRDI QIDQ2201668

Jose Carlos Perez-Torres, Jose Torres-Jimenez

Publication date: 29 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.10.048

zbMATH Keywords

graphsgreedy algorithmscovering arraysminimum clique cover

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) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• MaxCliqueDyn
• AETG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact bit-parallel algorithm for the maximum clique problem
• Constraint models for the covering test problem
• An exact algorithm for the maximum clique problem
• Covering arrays from cyclotomy
• Upper bounds for covering arrays by tabu search.
• A fast algorithm for the maximum clique problem
• Tower of covering arrays
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• A review on algorithms for maximum clique problems
• A survey of combinatorial testing
• Exhaustive Test Pattern Generation with Constant Weight Vectors
• Construction of non-isomorphic covering arrays
• Products of mixed covering arrays of strength two
• Orthogonal Arrays of Index Unity

This page was built for publication: A greedy algorithm to construct covering arrays using a graph representation