New recursive methods for transversal covers

Journal of Combinatorial Designs

Volumn 7, Issue 3, 1999, Pages 185-203

  Stevens, Brett ^a   Mendelsohn, Eric ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SET THEORY; SIMULATED ANNEALING;

COVERING ARRAYS; TRANSVERSAL COVERS; TRANSVERSAL DESIGNS;

GRAPH THEORY;

EID: 0032632722     PISSN: 10638539     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6610(1999)7:3<185::AID-JCD3>3.0.CO;2-3     Document Type: Article

References (23)

1. D. Ashlock, "Finding designs with genetic algorithms," Mathematics and its applications, Vol. 368, 1st ed. Chap. 4, Kluwer Academic Publishers, Dordrecht, 1996, pp. 49-65.
2. T. Beth, D. Jungnickel, and H. Lenz, Design theory, Cambridge University Press, Cambridge, 1985.
3. D. M. Cohen, S. R. Dalal, M. L. Fredman, and G. C. Patton, The AETG system: An approach to testing based on combinatorial design, IEEE Trans Soft Eng 23 (1997), 437-444.
4. D. M. Cohen, S. R. Dalal, J. Parelius, and G. C. Patton, The combinatorial design approach to automatic test generation, IEEE Software 13(5) (September 1996), 83-88.
5. C. J. Colbourn and J. H. Dinitz, Editors, The CRC handbook of combinatorial designs, 1st ed., CRC Press, Boca Raton, 1996.
6. C. J. Colbourn and J. H. Dinitz, "Making the MOLS table," Mathematics and its applications, Vol. 368, 1st ed., Chap. 5, Kluwer Academic Publishers, Dordrecht, 1996, pp. 67-134.
7. L. Gargano, J. Körner, and U. Vaccaro, Qualitative independence and Sperner problems for directed graphs, J Combin Theory Ser A 61 (1992), 173-192.
8. _, Spemer capacities, Graphs Combin 9 (1993), 31-46.
9. _, Capacities: From information theory to extremal set theory, J Combin Theory Ser A 68 (1994), 296-316.
10. P. B. Gibbons, Personal communication, 1996.
11. P. B. Gibbons, E. Mendelsohn, and H. Shen, The construction of antipodal triple systems by simulated annealing, Discrete Math 155(1-3) (1996), 59-76.
12. G. O. H. Katona, Two applications (for search theory and truth functions) of Sperner type theorems, Period Math Hungar 3 (1973), 19-26.
13. D. J. Kleitman and J. Spencer, Families of k-independent sets, Discrete Math 6 (1973), 255-262.
14. J. Körner and M. Lucertini, Compressing inconsistent data, IEEE Trans Inform Theory 40(3) (May 1994), 706-715.
15. A. Ling and Brett Stevens, A direct construction of transversal covers using group divisible designs, In preparation.
16. S. Poljak, A. Pultr, and V. Rödl, On qualitatively independent partitions and related problems, Discrete Applied Mathematics 6 (1983), 193-205.
17. S. Poljak and Z. Tuza, On the maximum number of qualitatively independent partitions, J Combin Theory 51 (1989), 111-116.
18. A. Rényi, Foundations of probability, Wiley, New York, 1971.
19. N. J. A. Sloane, Covering arrays and intersecting codes, J Combin Des 1 (1993), 51-63.
20. E. Sperner, Ein Satz über Untermengen einer endlichen Menge, Math Z 27 (1928), 544-548.
21. B. Stevens, unpublished result.
22. B. Stevens, L. Moura, and E. Mendelsohn, Lower bounds for transversal covers, to appear in Des Codes Crypt.
23. A. W. Williams and R. L. Probert, A practical strategy for testing pair-wise convergence of network interfaces, Proc. of the 7th International Symposium on Software Reliability Engineering, 1996, pp. 246-254.