Covering Arrays Avoiding Forbidden Edges
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Covering arrays avoiding forbidden edges
Theoretical Computer Science
Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
Theoretical Computer Science
Finding the best CAFE is NP-hard
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Confluence in data reduction: bridging graph transformation and kernelization
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Hi-index | 0.05 |