An asynchronous P system using branch and bound for minimum graph coloring

Membrane computing is a computational model based on activity of cells. Using the membrane computing, a number of computationally hard problems have been solved in a polynomial number of steps using an exponential number of membranes. However, the number of membranes denotes the number of cells from practical point of view, and the reduction of the number of membranes must be considered for using the membrane computing in real world. In this paper, we propose an asynchronous P system with branch and bound for reducing the number of membranes. In addition, we evaluate validity of the proposed P system using computational simulations. The experimental results show the validity and efficiency of the proposed P system with branch and bound.