The Graph Coloring Problem (GCP) asks for the minimum number of colors required to color the vertices of a graph such that no two adjacent vertices have the same color. In this thesis we present an evolutionary algorithm for the GCP with novel crossover operations using graph partitioning. Our population contains only legal colorings and we use various greedy coloring algorithms to initialize i...

In this paper we present our study of greedy algorithms for solving the minimum sum coloring problem (MSCP). We propose two families of greedy algorithms for solving MSCP, and suggest improvements to the two greedy algorithms most often referred to in the literature for solving the graph coloring problem (GCP): DSATUR [1] and RLF [2].

The Graph Coloring Problem (GCP) is one of the most interesting, studied, and difficult combinatorial optimization problems. That is why several approaches were developed for solving this problem, including exact approaches, heuristic approaches, metaheuristics, and hybrid approaches. This paper tries to solve the graph coloring problem using a discrete binary version of cuckoo search algorithm...

In aviation industry, free flight is a new concept which implies considering more freedom in the selection and modification of flight paths during flight time. The free flight concept allows pilots choose their own flight paths more efficient, and also plan for their flight with high performance. Although free flight has many advantages such as minimum delays and the reduction of the workload o...

Chemokines are important mediators of leukocyte migration during the inflammatory response. Post-translational modifications affect the biological potency of chemokines. In addition to previously identified NH2-terminally truncated forms, COOH-terminally truncated forms of the CXC chemokine murine granulocyte chemotactic protein-2 (GCP-2) were purified from conditioned medium of stimulated fibr...

We adapt the Cuckoo Search (CS) algorithm for solving the three color Graph Coloring Problem (3-GCP). The difficulty of this task is adapting CS from a continuous to a discrete domain. Previous researches used sigmoid functions to discretize the Lévi Flight (LF) operator characteristic of CS, but this approach does not take into account the concept of Solution Distance, one of the main characte...

Graph Coloring Problem (GCP) is the assignment of colors to certain elements in a graph based on constraints. GCP used by assigning color label each node with neighboring nodes assigned different and minimum number used. Based this, can be drawn into an optimization problem that minimize Optimization problems coloring occur due uncertainty use used, so it assumed there colored vertices. One mat...

Previous studies have demonstrated that the novel protein Gcp is essential for the viability of various bacterial species including Staphylococcus aureus; however, the reason why it is required for bacterial growth remains unclear. In order to explore the potential mechanisms of this essentiality, we performed RT-PCR analysis and revealed that the gcp gene (sa1854) was co-transcribed with sa185...

Our previous studies demonstrated that a putative Staphylococcus aureus glycoprotease (Gcp) is essential for bacterial survival, indicating that Gcp may be a novel target for developing antibacterial agents. However, the biological function of Gcp is unclear. In order to elucidate the reason that Gcp is required for growth, we examined the role of Gcp in bacterial autolysis, which is an importa...

Electronic Design Automation (EDA) in the nano era faces a fresh set of challenges. Designs are getting larger and more complex, and design metrics are evolving from area and performance in the past to power and reliability in the future. In this changing landscape, the ITRS roadmap notes that it is imperative that we raise the level of abstraction in system-level design to deal with this incre...