메뉴 건너뛰기




Volumn 308, Issue 24, 2008, Pages 6022-6035

Optimal and near-optimal mixed covering arrays by column expansion

Author keywords

Covering array; Latin ordered design; Mixed covering array; Ordered design; Orthogonal array

Indexed keywords

COVERING ARRAY; LATIN ORDERED DESIGN; MIXED COVERING ARRAY; ORDERED DESIGN; ORTHOGONAL ARRAY;

EID: 56649083704     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.11.021     Document Type: Article
Times cited : (15)

References (13)
  • 1
    • 0000662581 scopus 로고
    • Orthogonal arrays of index unity
    • Bush K.A. Orthogonal arrays of index unity. Ann. Math. Statist. 23 (1952) 426-434
    • (1952) Ann. Math. Statist. , vol.23 , pp. 426-434
    • Bush, K.A.1
  • 2
    • 0037681012 scopus 로고    scopus 로고
    • On the state of strength-three covering arrays
    • Chateauneuf M.A., and Kreher D. On the state of strength-three covering arrays. J. Combin. Des. 10 4 (2002) 217-238
    • (2002) J. Combin. Des. , vol.10 , Issue.4 , pp. 217-238
    • Chateauneuf, M.A.1    Kreher, D.2
  • 3
    • 33748433846 scopus 로고    scopus 로고
    • Combinatorial aspects of covering arrays
    • Colbourn C.J. Combinatorial aspects of covering arrays. Le Mat. (Catania) 58 (2004) 121-167
    • (2004) Le Mat. (Catania) , vol.58 , pp. 121-167
    • Colbourn, C.J.1
  • 4
    • 38049115622 scopus 로고    scopus 로고
    • Strength two covering arrays: Existence tables and projection
    • Colbourn C.J. Strength two covering arrays: Existence tables and projection. Discrete Math. 308 5-6 (2008) 772-786
    • (2008) Discrete Math. , vol.308 , Issue.5-6 , pp. 772-786
    • Colbourn, C.J.1
  • 7
    • 0038695327 scopus 로고
    • Two applications (for search theory and truth functions) of Sperner type theorems
    • Katona G. Two applications (for search theory and truth functions) of Sperner type theorems. Period. Math. 3 (1973) 19-26
    • (1973) Period. Math. , vol.3 , pp. 19-26
    • Katona, G.1
  • 8
    • 0000294926 scopus 로고
    • Families of k-independent sets
    • Kleitman D., and Spencer J. Families of k-independent sets. Discrete Math. 6 (1973) 255-262
    • (1973) Discrete Math. , vol.6 , pp. 255-262
    • Kleitman, D.1    Spencer, J.2
  • 10
    • 0039162401 scopus 로고
    • Orthogonal partitions and covering of graphs
    • Poljak S., and Rödl V. Orthogonal partitions and covering of graphs. Czechoslovak Math. J. 30 105 (1980) 475-485
    • (1980) Czechoslovak Math. J. , vol.30 , Issue.105 , pp. 475-485
    • Poljak, S.1    Rödl, V.2
  • 11
    • 0009781779 scopus 로고
    • On the maximum number of qualitatively independent partitions
    • Poljak S., and Tuza Z. On the maximum number of qualitatively independent partitions. J. Combin. Theory Ser. A 51 1 (1989) 111-116
    • (1989) J. Combin. Theory Ser. A , vol.51 , Issue.1 , pp. 111-116
    • Poljak, S.1    Tuza, Z.2
  • 13
    • 56649098331 scopus 로고    scopus 로고
    • B. Stevens, Transversal covers and packings, Ph.D. Thesis, University of Toronto, 1998
    • B. Stevens, Transversal covers and packings, Ph.D. Thesis, University of Toronto, 1998


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.