The graph coloring problem, an NP-hard combinatorial optimization problem, is required in
some engineering applications. This research focuses on the requirement of designing a …

Some of the engineering applications warrant the solution of Graph Coloring Problem, an
NP-hard combinatorial optimization problem. This paper focuses on designing three new …

Given a graph whose vertex set is partitioned, the partition coloring problem (PCP) requires
the selection of one vertex from each partite set, such that the subgraph induced by the set of …

The graph coloring problem is an NP-hard combinatorial optimization problem and can be
applied to various engineering applications. The chromatic number of a graph G is defined …

Recent years, a large amount of graph coloring algorithms have been applied in different
disciplines and engineering. This paper exhibits a new multi-objective evolutionary …

Abstract We study the Partition Coloring Problem (PCP), a generalization of the Vertex
Coloring Problem where the vertex set is partitioned. The PCP asks to select one vertex for …

This paper investigates the vertex coloring problem in an uncertain graph in which all
vertices are deterministic, while all edges are not deterministic and exist with some degree …

This paper considers the Maximum Selective Tree Problem (MSelTP) as a generalization of
the Maximum Induced Tree problem. Given an undirected graph with a partition of its vertex …

The article addresses applications of combinatorial clustering engineering approach in
communication networks including design of layered network architecture, routing …

The article addresses applications of combinatorial clustering engineering approach in
communication networks including design of layered network architecture, routing …