{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:47:43Z","timestamp":1725533263932},"publisher-location":"Berlin, Heidelberg","reference-count":63,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642018138"},{"type":"electronic","value":"9783642018770"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01877-0_3","type":"book-chapter","created":{"date-parts":[[2009,6,6]],"date-time":"2009-06-06T07:01:52Z","timestamp":1244271712000},"page":"22-33","source":"Crossref","is-referenced-by-count":11,"title":["Binary Covering Arrays and Existentially Closed Graphs"],"prefix":"10.1007","author":[{"given":"Charles J.","family":"Colbourn","sequence":"first","affiliation":[]},{"given":"Gerzson","family":"K\u00e9ri","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1478-6","volume-title":"Orthogonal Arrays","author":"A.S. Hedayat","year":"1999","unstructured":"Hedayat, A.S., Sloane, N.J.A., Stufken, J.: Orthogonal Arrays. Springer, New York (1999)"},{"issue":"4","key":"3_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jcd.10002","volume":"10","author":"M.A. Chateauneuf","year":"2002","unstructured":"Chateauneuf, M.A., Kreher, D.L.: On the state of strength-three covering arrays. J. Combin. Des.\u00a010(4), 217\u2013238 (2002)","journal-title":"J. Combin. Des."},{"key":"3_CR3","first-page":"121","volume":"58","author":"C.J. Colbourn","year":"2004","unstructured":"Colbourn, C.J.: Combinatorial aspects of covering arrays. Le Matematiche (Catania)\u00a058, 121\u2013167 (2004)","journal-title":"Le Matematiche (Catania)"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/0-387-25036-0_10","volume-title":"Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms","author":"A. Hartman","year":"2005","unstructured":"Hartman, A.: Software and hardware testing using combinatorial covering suites. In: Golumbic, M.C., Hartman, I.B.A. (eds.) Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms, pp. 237\u2013266. Springer, Norwell (2005)"},{"issue":"1-3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.disc.2003.11.029","volume":"284","author":"A. Hartman","year":"2004","unstructured":"Hartman, A., Raskin, L.: Problems and algorithms for covering arrays. Discrete Math\u00a0284(1-3), 149\u2013156 (2004)","journal-title":"Discrete Math"},{"issue":"7","key":"3_CR6","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/32.605761","volume":"23","author":"D.M. Cohen","year":"1997","unstructured":"Cohen, D.M., Dalal, S.R., Fredman, M.L., Patton, G.C.: The AETG system: an approach to testing based on combinatorial design. IEEE Transactions on Software Engineering\u00a023(7), 437\u2013444 (1997)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1017\/S0963548300001905","volume":"5","author":"A.P. Godbole","year":"1996","unstructured":"Godbole, A.P., Skipper, D.E., Sunley, R.A.: t-covering arrays: upper bounds and Poisson approximations. Combinatorics, Probability and Computing\u00a05, 105\u2013118 (1996)","journal-title":"Combinatorics, Probability and Computing"},{"key":"3_CR8","unstructured":"Roux, G.: k-Propri\u00e9t\u00e9s dans les tableaux de n colonnes: cas particulier de la k-surjectivit\u00e9 et de la k-permutivit\u00e9. PhD thesis, Universit\u00e9 de Paris (1987)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"2709","DOI":"10.1016\/j.disc.2006.06.036","volume":"308","author":"M.B. Cohen","year":"2008","unstructured":"Cohen, M.B., Colbourn, C.J., Ling, A.C.H.: Constructing strength three covering arrays with augmented annealing. Discrete Math.\u00a0308, 2709\u20132722 (2008)","journal-title":"Discrete Math."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10623-006-0020-8","volume":"41","author":"C.J. Colbourn","year":"2006","unstructured":"Colbourn, C.J., Martirosyan, S.S., van Trung, T., Walker II, R.A.: Roux-type constructions for covering arrays of strengths three and four. Designs, Codes and Cryptography\u00a041, 33\u201357 (2006)","journal-title":"Designs, Codes and Cryptography"},{"key":"3_CR11","first-page":"266","volume":"74","author":"S.S. Martirosyan","year":"2005","unstructured":"Martirosyan, S.S., Colbourn, C.J.: Recursive constructions for covering arrays. Bayreuther Math. Schriften\u00a074, 266\u2013275 (2005)","journal-title":"Bayreuther Math. Schriften"},{"issue":"1-3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/B:DESI.0000029232.40302.6d","volume":"32","author":"S.S. Martirosyan","year":"2004","unstructured":"Martirosyan, S.S., van Trung, T.: On t-covering arrays. Des. Codes Cryptogr.\u00a032(1-3), 323\u2013339 (2004)","journal-title":"Des. Codes Cryptogr."},{"key":"3_CR13","unstructured":"Colbourn, C.J.: Covering arrays 2005\u2013present, http:\/\/www.public.asu.edu\/~ccolbou\/src\/tabby"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/3-540-44598-6_33","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"J. Bierbrauer","year":"2000","unstructured":"Bierbrauer, J., Schellwat, H.: Almost independent and weakly biased arrays: efficient constructions and cryptologic applications. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 533\u2013543. Springer, Heidelberg (2000)"},{"key":"3_CR15","unstructured":"Colbourn, C.J.: Distributing hash families and covering arrays. J. Combin. Inf. Syst. Sci. (to appear)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jcd.3180010106","volume":"1","author":"N.J.A. Sloane","year":"1993","unstructured":"Sloane, N.J.A.: Covering arrays and intersecting codes. Journal of Combinatorial Designs\u00a01, 51\u201363 (1993)","journal-title":"Journal of Combinatorial Designs"},{"issue":"2","key":"3_CR17","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1147\/rd.282.0212","volume":"28","author":"D.T. Tang","year":"1984","unstructured":"Tang, D.T., Chen, C.L.: Iterative exhaustive pattern generation for logic testing. IBM Journal Research and Development\u00a028(2), 212\u2013219 (1984)","journal-title":"IBM Journal Research and Development"},{"key":"3_CR18","unstructured":"Soriano, P.P.: Private communication by e-mail (March 2008)"},{"issue":"9","key":"3_CR19","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0166-218X(03)00291-9","volume":"138","author":"K. Nurmela","year":"2004","unstructured":"Nurmela, K.: Upper bounds for covering arrays by tabu search. Discrete Applied Mathematics\u00a0138(9), 143\u2013152 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR20","unstructured":"Yan, J.: A backtracking search tool for constructing combinatorial test suites. Technical Report ISCAS-LCS-07-04, Institute of Software, Chinese Academy of Sciences, Beijing, China (2007)"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10601-006-7094-9","volume":"11","author":"B. Hnich","year":"2006","unstructured":"Hnich, B., Prestwich, S., Selensky, E., Smith, B.M.: Constraint models for the covering test problem. Constraints\u00a011, 199\u2013219 (2006)","journal-title":"Constraints"},{"issue":"3","key":"3_CR22","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1002\/jcd.20067","volume":"14","author":"G.B. Sherwood","year":"2006","unstructured":"Sherwood, G.B., Martirosyan, S.S., Colbourn, C.J.: Covering arrays of higher strength from permutation vectors. J. Combin. Des.\u00a014(3), 202\u2013213 (2006)","journal-title":"J. Combin. Des."},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.jspi.2008.05.020","volume":"139","author":"R.A. Walker II","year":"2009","unstructured":"Walker II, R.A., Colbourn, C.J.: Tabu search for covering arrays using permutation vectors. J. Stat. Plann. Infer.\u00a0139, 69\u201380 (2009)","journal-title":"J. Stat. Plann. Infer."},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Bryce, R.C., Colbourn, C.J.: A density-based greedy algorithm for higher strength covering arrays. Software Testing, Verification, and Reliability (to appear)","DOI":"10.1002\/stvr.393"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Lei, Y., Kacker, R., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG: A general strategy for t-way software testing. In: Fourteenth Int. Conf. Engineering Computer-Based Systems, pp. 549\u2013556 (2007)","DOI":"10.1109\/ECBS.2007.47"},{"key":"3_CR26","unstructured":"Kuliamin, V.V.: Private communication by e-mail (February 2007)"},{"key":"3_CR27","unstructured":"Linnemann, D., Frewer, M.: Computations with the density algorithm (private communication by e-mail) (October 2008)"},{"key":"3_CR28","unstructured":"Kuhn, D.R., Lei, Y., Kacker, R., Okun, V., Lawrence, J.: Paintball: A fast algorithm for covering arrays of high strength. Internal Tech. Report, NISTIR 7308 (2007)"},{"issue":"3","key":"3_CR29","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/0095-8956(89)90054-3","volume":"46","author":"K.A. Johnson","year":"1989","unstructured":"Johnson, K.A., Entringer, R.: Largest induced subgraphs of the n-cube that contain no 4-cycles. J. Combin. Theory Ser. B\u00a046(3), 346\u2013355 (1989)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"220","DOI":"10.2307\/3613396","volume":"47","author":"P. Erd\u0151s","year":"1963","unstructured":"Erd\u0151s, P.: On a problem in graph theory. Math. Gaz.\u00a047, 220\u2013223 (1963)","journal-title":"Math. Gaz."},{"key":"3_CR31","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01895716","volume":"14","author":"P. Erd\u0151s","year":"1963","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: Asymmetric graphs. Acta Math. Acad. Sci. Hungar.\u00a014, 295\u2013315 (1963)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"issue":"3","key":"3_CR32","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1002\/jgt.3190030305","volume":"3","author":"A. Blass","year":"1979","unstructured":"Blass, A., Harary, F.: Properties of almost all graphs and complexes. J. Graph Theory\u00a03(3), 225\u2013240 (1979)","journal-title":"J. Graph Theory"},{"issue":"A","key":"3_CR33","first-page":"287","volume":"19","author":"L. Caccetta","year":"1985","unstructured":"Caccetta, L., Erd\u0151s, P., Vijayan, K.: A property of random graphs. Ars Combin.\u00a019(A), 287\u2013294 (1985)","journal-title":"Ars Combin."},{"key":"3_CR34","doi-asserted-by":"publisher","first-page":"290","DOI":"10.2307\/3612854","volume":"49","author":"E. Szekeres","year":"1965","unstructured":"Szekeres, E., Szekeres, G.: On a problem of Sch\u00fctte and Erd\u0151s. Math. Gaz.\u00a049, 290\u2013293 (1965)","journal-title":"Math. Gaz."},{"key":"3_CR35","first-page":"89","volume":"36","author":"W. Ananchuen","year":"1993","unstructured":"Ananchuen, W., Caccetta, L.: On tournaments with a prescribed property. Ars Combin.\u00a036, 89\u201396 (1993)","journal-title":"Ars Combin."},{"issue":"4","key":"3_CR36","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1002\/jgt.3190050406","volume":"5","author":"G. Exoo","year":"1981","unstructured":"Exoo, G.: On an adjacency property of graphs. J. Graph Theory\u00a05(4), 371\u2013378 (1981)","journal-title":"J. Graph Theory"},{"issue":"1","key":"3_CR37","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0012-365X(90)90283-N","volume":"29","author":"G. Exoo","year":"1980","unstructured":"Exoo, G., Harary, F.: The smallest graphs with certain adjacency properties. Discrete Math.\u00a029(1), 25\u201332 (1980)","journal-title":"Discrete Math."},{"key":"3_CR38","first-page":"73","volume":"10","author":"W. Ananchuen","year":"1994","unstructured":"Ananchuen, W., Caccetta, L.: On constructing graphs with a prescribed adjacency property. Australas. J. Combin.\u00a010, 73\u201383 (1994)","journal-title":"Australas. J. Combin."},{"issue":"1","key":"3_CR39","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1017\/S000497270001385X","volume":"51","author":"W. Ananchuen","year":"1995","unstructured":"Ananchuen, W., Caccetta, L.: A note on graphs with a prescribed adjacency property. Bull. Austral. Math. Soc.\u00a051(1), 5\u201315 (1995)","journal-title":"Bull. Austral. Math. Soc."},{"issue":"1-3","key":"3_CR40","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0012-365X(00)00309-5","volume":"231","author":"A. Bonato","year":"2001","unstructured":"Bonato, A., Cameron, K.: On an adjacency property of almost all graphs. Discrete Math.\u00a0231(1-3), 103\u2013119 (2001)","journal-title":"Discrete Math."},{"key":"#cr-split#-3_CR41.1","doi-asserted-by":"crossref","unstructured":"Bonato, A., Holzmann, W.H., Kharaghani, H.: Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property. Electron. J. Combin. 8(1) (2001);","DOI":"10.37236\/1545"},{"key":"#cr-split#-3_CR41.2","unstructured":"Research paper 1, 9 pp. (electronic)"},{"key":"#cr-split#-3_CR42.1","doi-asserted-by":"crossref","unstructured":"Cameron, P.J., Stark, D.: A prolific construction of strongly regular graphs with the n-e.c. property. Electron. J. Combin. 9(1) (2002);","DOI":"10.37236\/1647"},{"key":"#cr-split#-3_CR42.2","unstructured":"Research Paper 31, 12 pp. (electronic)"},{"key":"#cr-split#-3_CR43.1","doi-asserted-by":"crossref","unstructured":"Forbes, A.D., Grannell, M.J., Griggs, T.S.: Steiner triple systems and existentially closed graphs. Electron. J. Combin. 12 (2005);","DOI":"10.37236\/1939"},{"key":"#cr-split#-3_CR43.2","unstructured":"Research Paper 42, 11 pp. (elecronic)"},{"issue":"5-6","key":"3_CR44","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/j.disc.2007.07.029","volume":"308","author":"C.A. Baker","year":"2008","unstructured":"Baker, C.A., Bonato, A., Brown, J.M.N., Sz\u0151nyi, T.: Graphs with the n-e.c. adjacency property constructed from affine planes. Discrete Math.\u00a0308(5-6), 901\u2013912 (2008)","journal-title":"Discrete Math."},{"key":"3_CR45","doi-asserted-by":"publisher","first-page":"45","DOI":"10.4153\/CMB-1971-007-1","volume":"14","author":"R.L. Graham","year":"1971","unstructured":"Graham, R.L., Spencer, J.H.: A constructive solution to a tournament problem. Canad. Math. Bull.\u00a014, 45\u201348 (1971)","journal-title":"Canad. Math. Bull."},{"volume-title":"Random graphs","year":"1985","author":"B. Bollob\u00e1s","key":"3_CR46","unstructured":"Bollob\u00e1s, B.: Random graphs. Academic Press Inc., London (1985)"},{"issue":"4","key":"3_CR47","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1002\/jgt.3190050414","volume":"5","author":"A. Blass","year":"1981","unstructured":"Blass, A., Exoo, G., Harary, F.: Paley graphs satisfy all first-order adjacency axioms. J. Graph Theory\u00a05(4), 435\u2013439 (1981)","journal-title":"J. Graph Theory"},{"issue":"4","key":"3_CR48","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/net.3230230404","volume":"23","author":"W. Ananchuen","year":"1993","unstructured":"Ananchuen, W., Caccetta, L.: On the adjacency properties of Paley graphs. Networks\u00a023(4), 227\u2013236 (1993)","journal-title":"Networks"},{"issue":"197","key":"3_CR49","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1090\/S0025-5718-1992-1106978-9","volume":"58","author":"R. Peralta","year":"1992","unstructured":"Peralta, R.: On the distribution of quadratic residues and nonresidues modulo a prime number. Math. Comp.\u00a058(197), 433\u2013440 (1992)","journal-title":"Math. Comp."},{"issue":"3","key":"3_CR50","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"Alon, N., Goldreich, O., H\u00e5stad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. Random Structures Algorithms\u00a03(3), 289\u2013304 (1992)","journal-title":"Random Structures Algorithms"},{"issue":"1","key":"3_CR51","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02122698","volume":"10","author":"A.A. Razborov","year":"1990","unstructured":"Razborov, A.A.: Applications of matrix methods to the theory of lower bounds in computational complexity. Combinatorica\u00a010(1), 81\u201393 (1990)","journal-title":"Combinatorica"},{"key":"3_CR52","first-page":"603","volume-title":"Proceedings of the Twenty-eighth Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996)","author":"L. Babai","year":"1996","unstructured":"Babai, L., G\u00e1l, A., Koll\u00e1r, J., R\u00f3nyai, L., Szab\u00f3, T., Wigderson, A.: Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs. In: Proceedings of the Twenty-eighth Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996), pp. 603\u2013611. ACM, New York (1996)"},{"issue":"3","key":"3_CR53","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s004930050058","volume":"19","author":"L. Babai","year":"1999","unstructured":"Babai, L., G\u00e1l, A., Wigderson, A.: Superpolynomial lower bounds for monotone span programs. Combinatorica\u00a019(3), 301\u2013319 (1999)","journal-title":"Combinatorica"},{"issue":"4","key":"3_CR54","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s000370100001","volume":"10","author":"A. G\u00e1l","year":"2001","unstructured":"G\u00e1l, A.: A characterization of span program size and improved lower bounds for monotone span programs. Comput. Complexity\u00a010(4), 277\u2013296 (2001)","journal-title":"Comput. Complexity"},{"issue":"4","key":"3_CR55","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1017\/S0963548303005674","volume":"12","author":"M. Borowiecki","year":"2003","unstructured":"Borowiecki, M., Grytczuk, J., Ha\u0142uszczak, M., Tuza, Z.: Sch\u00fctte\u2019s tournament problem and intersecting families of sets. Combin. Probab. Comput.\u00a012(4), 359\u2013364 (2003)","journal-title":"Combin. Probab. Comput."},{"issue":"1-3","key":"3_CR56","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0012-365X(94)90024-8","volume":"133","author":"H. Kimura","year":"1994","unstructured":"Kimura, H.: Classification of Hadamard matrices of order 28. Discrete Math.\u00a0133(1-3), 171\u2013180 (1994)","journal-title":"Discrete Math."},{"volume-title":"Classification algorithms for codes and designs","year":"2006","author":"P. Kaski","key":"3_CR57","unstructured":"Kaski, P., \u00d6sterg\u00e5rd, P.R.J.: Classification algorithms for codes and designs. Springer, Berlin (2006)"},{"key":"3_CR58","unstructured":"Seberry, J.R.: Library of Hadamard matrices, http:\/\/www.uow.edu.au\/~jennie\/hadamard.html"},{"key":"3_CR59","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1017\/S002776300002273X","volume":"104","author":"V.D. Tonchev","year":"1986","unstructured":"Tonchev, V.D.: Hadamard matrices of order 36 with automorphisms of order 17. Nagoya Math. J.\u00a0104, 163\u2013174 (1986)","journal-title":"Nagoya Math. J."},{"issue":"2","key":"3_CR60","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009813","volume":"18","author":"Y. Azar","year":"1998","unstructured":"Azar, Y., Motwani, R., Naor, J.: Approximating probability distributions using small sample spaces. Combinatorica\u00a018(2), 151\u2013171 (1998)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Coding and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01877-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T08:58:58Z","timestamp":1589878738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01877-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642018138","9783642018770"],"references-count":63,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01877-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}