In this paper we present the Selective Graph Coloring Problem, a generalization of the
standard graph coloring problem as well as several of its possible applications. Given a …

Given a graph G=(V, E) G=(V,E) and a subset of its vertices V′⊆ VV^′⊆V, the subgraph
induced by V′ V^′ in G is that with vertex set V′ V^′ and edge set E′ E^′ formed by …

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 …

Digital Annealer (DA) is a computer architecture designed for tackling combinatorial
optimization problems formulated as quadratic unconstrained binary optimization (QUBO) …

The problem of routing and wavelength assignment in wavelength division multiplexing
optical networks consists in routing a set of lightpaths and assigning a wavelength to each of …

Given a simple undirected graph G, its Grundy chromatic number Γ (G)(or Grundy number)
defines the worst-case behavior for the well-known and widely-used greedy first-fit coloring …

In this paper we propose a hybrid Ant Colony Optimization (ACO) algorithm for the Partition
Graph Coloring Problem (PGCP). Given an undirected graph G=(V, E), whose nodes are …

In this work, we study graph clustering problems associated with structural balance. One of
these problems is known in computer science literature as the correlation-clustering (CC) …

Given a simple graph G=(V, E) and a real constant γ∈(0, 1], a γ-clique (or γ-quasi-clique) is
a subset V′⊆ V inducing a subgraph with edge density at least γ. The minimum quasi …

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 …