In a typical maximum clique search algorithm when optimality testing is inconclusive a forking takes place. The instance is divided into smaller ones. This is the branching step of the procedure. In order to ensure a balanced work load for the processors for parallel algorithms it is essential that the resulting smaller problems are do not overly vary in difficulty. The so-called splitting partitions of the nodes of the given graph were introduced earlier to meliorate this problem. The paper proposes a splitting partition of the edges for the same purpose. In the lack of available theoretical tools we assess the practical feasibility of constructing suboptimal splitting edge partitions by carrying out numerical experiments. While working with splitting partitions we have realized that they can be utilized as preconditioning tools preliminary to a large scale clique search. The paper will discuss this new found role of the splitting edge partitions as well.
CARRAGHAN, R., AND PARDALOS, P. M. An exact algorithm for the maximum clique problem. Operation Research Letters9 (1990), 375–382.
CARRAGHAN, R., AND PARDALOS, P. M. An exact algorithm for the maximum clique problem. Operation Research Letters 9 (1990), 375–382.)| false