Parallel Maximum Clique Algorithm for Uniform Test Assembly

Abstract

Recently, the necessity of ''uniform test forms'' for which each form comprises a different set of items, but which still has equivalent measurement accuracy has been emerging. For uniform test assembly, one of the most important issues is how to assemble uniform tests as many as possible. For this purpose, this study proposes a new uniform test assembly: Hybrid Maximum Clique Algorithm with Parallel Integer Programming (HMCAPIP). The first step seeks a maximum clique as large as possible up to a computer limitation. The second step repeats the parallel search of the vertices connected with all the vertices of the current clique using Integer Programming. Our method assembles nearly twice the number of uniform tests of the traditional methods.