New methods to color the vertices of a graph, Communications of the ACM, vol.22, issue.4, pp.251-256, 1979. ,
DOI : 10.1145/359094.359101
Generating small combinatorial test suites to cover input-output relationships, Third International Conference on Quality Software, 2003. Proceedings., pp.76-82, 2003. ,
DOI : 10.1109/QSIC.2003.1319088
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.2445
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs, SIAM Journal on Computing, vol.31, issue.5, pp.1608-1623, 2002. ,
DOI : 10.1137/S0097539700381097
A practical tutorial on modified condition/decision coverage, 2001. ,
DOI : 10.1109/dasc.2001.963305
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.341
A Better Approximation Ratio for the Vertex Cover Problem, Lecture Notes in Computer Science, vol.3580, pp.1043-1050, 2005. ,
DOI : 10.1007/11523468_84
Vertex cover might be hard to approximate to within 2-??, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings., pp.335-349, 2008. ,
DOI : 10.1109/CCC.2003.1214437
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.1616
Pairwise testing with QICT, MSDN Magazine, vol.29, issue.12, pp.28-35, 2009. ,
A construction for strength-3 covering arrays from linear feedback shift register sequences, Designs, Codes and Cryptography, vol.73, issue.3, pp.949-968, 2014. ,
DOI : 10.1007/s10623-013-9835-2
A test generation strategy for pairwise testing, IEEE Trans. Software Eng, vol.28, issue.1, pp.109-111, 2002. ,
Improving IPOG's vertical growth based on a graph coloring scheme Verification and Validation Workshops, 8th IEEE International Conference on Software Testing, pp.1-8, 2015. ,
Relationship between pair-wise and MC/DC testing: Initial experimental results, 2015 IEEE Eighth International Conference on Software Testing, Verification and Validation Workshops (ICSTW), 2015. ,
DOI : 10.1109/ICSTW.2015.7107439