A complete resolution of the Keller maximum clique problem

Then, we distinguish different classes of main component depending on the number of vertices on the lower level, on the upper level, and depending on the number of parallel

• In the fifth chapter, we apply the AMTS algorithm proposed in Chapter 2 for the maximum clique problem to deal with the graph coloring problem, and present the heuristic approach

To demonstrate the usefulness of the PUSH operator for solving MVWCP, we introduced two restart tabu search algorithms (ReTS-I and ReTS-II) which apply PUSH on different candidate

If it were possible to identify under what conditions actions produce equivalent kinds of effects, the planning problem could be simplified by considering a representative action

In this work, as likely the very first attempt to quantify organosulfates in ambient aerosol, we inferred the mass concentrations of organic sulfur by difference from con-

The first option is to use one of the proposed gene set testing methods that are based on classical statistical models, and which by construction already test a self-contained

accounts have less than 3,500 followers and followings (we do not show the 563,481 accounts outside of this range in Fig. We observe three interesting properties in this figure.

To improve the quality of a constructed clique, local search can be used to explore its neighborhood, i.e., the set of cliques that can be obtained by removing and/or adding a