{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:09:54Z","timestamp":1725516594874},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_28","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"296-308","source":"Crossref","is-referenced-by-count":3,"title":["Covering Arrays Avoiding Forbidden Edges"],"prefix":"10.1007","author":[{"given":"Peter","family":"Danziger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Mendelsohn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucia","family":"Moura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brett","family":"Stevens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0012-365X(84)90101-8","volume":"52","author":"R.C. Brigham","year":"1984","unstructured":"Brigham, R.C., Dutton, R.D.: Upper bounds on the edge clique cover number of a graph. Discrete Math.\u00a052, 31\u201337 (1984)","journal-title":"Discrete Math."},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1002\/net.3230210405","volume":"21","author":"R.C. Brigham","year":"1991","unstructured":"Brigham, R.C., Dutton, R.D.: A compilation of relations between graph invariants. Supplement I. Networks\u00a021, 421\u2013455 (1991)","journal-title":"Networks"},{"key":"28_CR3","first-page":"503","volume-title":"Proc. Intl. Conf. on Soft. Test. Anal. and Rev.","author":"K. Burr","year":"1998","unstructured":"Burr, K., Young, W.: Combinatorial test techniques: Table-based automation, test generation, and code coverage. In: Proc. Intl. Conf. on Soft. Test. Anal. and Rev., October 1998, pp. 503\u2013513. ACM, New York (1998)"},{"key":"28_CR4","first-page":"769","volume":"29","author":"J.N. Cawse","year":"2002","unstructured":"Cawse, J.N.: Experimental design for combinatorial and high throughput materials development. GE Global Research Technical Report\u00a029, 769\u2013781 (2002)","journal-title":"GE Global Research Technical Report"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Cohen, M.B., Dwyer, M.B., Shi, J.: Interaction testing of highly-configurable systems in the presence of constraints. In: International Symposium on Software Testing and Analysis (ISSTA), London, July 2007, pp. 129\u2013139 (2007)","DOI":"10.1145\/1273463.1273482"},{"key":"28_CR6","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":"28_CR7","unstructured":"Colbourn, C.J.: Covering arrays. In: Colbourn and Dinitz [8], pp. 361\u2013364"},{"key":"28_CR8","series-title":"Discrete Mathematics and its Applications","volume-title":"Handbook of combinatorial designs","year":"2007","unstructured":"Colbourn, C.J., Dinitz, J.H. (eds.): Handbook of combinatorial designs, 2nd edn. Discrete Mathematics and its Applications. Chapman & Hall\/CRC, Boca Raton (2007)","edition":"2"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Dalal, S.R., Karunanithi, A.J.N., Leaton, J.M.L., Patton, G.C.P., Horowitz, B.M.: Model-based testing in practice. In: Proc. Intl. Conf. on Software Engineering (ICSE 1999), pp. 285\u2013294 (1999)","DOI":"10.1145\/302405.302640"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/253228.253271","volume-title":"Proc. Intl. Conf. on Software Engineering (ICSE 1997)","author":"S. Dunietz","year":"1997","unstructured":"Dunietz, S., Ehrlich, W.K., Szablak, B.D., Mallows, C.L., Iannino, A.: Applying design of experiments to software testing. In: Proc. Intl. Conf. on Software Engineering (ICSE 1997), October 1997, pp. 205\u2013215. IEEE, Los Alamitos (1997)"},{"key":"28_CR11","doi-asserted-by":"crossref","first-page":"106","DOI":"10.4153\/CJM-1966-014-3","volume":"18","author":"P. Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., Goodman, A.W., P\u00f3sa, L.: The representation of a graph by set intersections. Canad. J. Math.\u00a018, 106\u2013112 (1966)","journal-title":"Canad. J. Math."},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01195325","volume":"9","author":"L. Gargano","year":"1993","unstructured":"Gargano, L., K\u00f6rner, J., Vaccaro, U.: Sperner capacities. Graphs Combin.\u00a09, 31\u201346 (1993)","journal-title":"Graphs Combin."},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0012-365X(90)90168-H","volume":"85","author":"A. Gy\u00e1rf\u00e1s","year":"1990","unstructured":"Gy\u00e1rf\u00e1s, A.: A simple lower bound on edge coverings by cliques. Discrete Math.\u00a085, 103\u2013104 (1990)","journal-title":"Discrete Math."},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/359340.359346","volume":"21","author":"L.T. Kou","year":"1978","unstructured":"Kou, L.T., Stockmeyer, L.J., Wong, C.K.: Covering edges by cliques with regard to keyword conflicts and intersection graphs. Comm. ACM\u00a021, 135\u2013139 (1978)","journal-title":"Comm. ACM"},{"key":"28_CR15","first-page":"91","volume-title":"Proc. 27th Annual NASA Goddard\/IEEE Software Engineering Workshop","author":"D.R. Kuhn","year":"2002","unstructured":"Kuhn, D.R., Reilly, M.: An investigation of the applicability of design of experiments to software testing. In: Proc. 27th Annual NASA Goddard\/IEEE Software Engineering Workshop, October 2002, pp. 91\u201395. IEEE, Los Alamitos (2002)"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TSE.2004.24","volume":"30","author":"D.R. Kuhn","year":"2004","unstructured":"Kuhn, D.R., Wallace, D.R., Gallo, A.M.: Software fault interactions and implications for software testing. IEEE Trans. Soft. Eng.\u00a030, 418\u2013421 (2004)","journal-title":"IEEE Trans. Soft. Eng."},{"key":"28_CR17","first-page":"231","volume-title":"Theory of Graphs (Proc. Colloq., Tihany, 1966)","author":"L. Lov\u00e1sz","year":"1968","unstructured":"Lov\u00e1sz, L.: On covering of graphs. In: Theory of Graphs (Proc. Colloq., Tihany, 1966), pp. 231\u2013236. Academic Press, New York (1968)"},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1145\/4372.4375","volume":"28","author":"R. Mandl","year":"1985","unstructured":"Mandl, R.: Orthogonal latin squares: An application of experiment design to compiler testing. Communic. of the ACM\u00a028, 1054\u20131058 (1985)","journal-title":"Communic. of the ACM"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Martinez, C., Moura, L., Panario, D., Stevens, B.: Algorithms to locate errors using covering arrays. In: Proc. LATIN 2008 - 8th Latin American Theoretical INformatics conference (April 2008)","DOI":"10.1007\/978-3-540-78773-0_44"},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/jcd.20149","volume":"15","author":"K. Meagher","year":"2007","unstructured":"Meagher, K., Moura, L., Zekaoui, L.: Mixed covering arrays on graphs. Journal of Combinatorial Designs\u00a015, 393\u2013404 (2007)","journal-title":"Journal of Combinatorial Designs"},{"key":"28_CR21","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jctb.2005.03.005","volume":"95","author":"K. Meagher","year":"2005","unstructured":"Meagher, K., Stevens, B.: Covering arrays on graphs. J. Combin. Theory. Ser. B\u00a095, 134\u2013151 (2005)","journal-title":"J. Combin. Theory. Ser. B"},{"key":"28_CR22","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/jcd.10059","volume":"11","author":"L. Moura","year":"2003","unstructured":"Moura, L., Stardom, J., Stevens, B., Williams, A.W.: Covering arrays with mixed alphabet sizes. J. Combin. Des.\u00a011, 413\u2013432 (2003)","journal-title":"J. Combin. Des."},{"key":"28_CR23","unstructured":"Nuutila, E.: Efficient transitive closure computation in large digraphs. Acta Polytechnica Scandinavica, Mathematics and Computing in Engineering Series, Finnish Academy of Technology, vol.\u00a074 (1995)"},{"key":"28_CR24","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1109\/18.6031","volume":"34","author":"G. Seroussi","year":"1988","unstructured":"Seroussi, G., Bshouty, N.H.: Vector sets for exhaustive testing of logic circuits. IEEE Transactions on Information Theory\u00a034, 513\u2013522 (1988)","journal-title":"IEEE Transactions on Information Theory"},{"key":"28_CR25","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1104\/pp.127.4.1590","volume":"127","author":"D.E. Shasha","year":"2001","unstructured":"Shasha, D.E., Kouranov, A.Y., Lejay, L.V., Chou, M.F., Coruzzi, G.M.: Using combinatorial design to study regulation by multiple input signals: A tool for parsimony in the post-genomics era. Plant Physiology\u00a0127, 1590\u20132594 (2001)","journal-title":"Plant Physiology"},{"key":"28_CR26","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, 212\u2013219 (1984)","journal-title":"IBM Journal Research and Development"},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Williams, A.W., Probert, R.L.: A measure for component interaction test coverage. In: Proc. ACS\/IEEE Intl. Conf. Comput. Syst. & Applic., pp. 301\u2013311 (2001)","DOI":"10.1109\/AICCSA.2001.934001"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:41:02Z","timestamp":1619523662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}