相关论文: The connected Grundy coloring problem: Formulation…

Our work becomes integrated into the general problem of the stability of the network ad hoc. Some, works attacked this problem. Among these works, we find the modelling of the network ad hoc in the form of a graph. Thus the problem of…

The Grundy (or First-Fit) chromatic number of a graph $G=(V,E)$, denoted by $\Gamma(G)$ (or $\chi_{_{\sf FF}}(G)$), is the maximum number of colors used by a First-Fit (greedy) coloring of $G$. To determine $\Gamma(G)$ is NP-complete for…

Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This model gets to…

We consider the strongly NP-hard single-machine coupled task scheduling problem with exact delays to minimize the makespan. In this problem, a set of jobs has to be scheduled, each composed of two tasks interspersed by an exact delay. Given…

The vertex coloring problem asks for the minimum number of colors that can be assigned to the vertices of a given graph such that for all vertices v the color of v is different from the color of any of its neighbors. The problem is NP-hard.…

Given a graph $G=(V,E)$, the $b$-coloring problem consists in attributing a color to every vertex in $V$ such that adjacent vertices receive different colors, every color has a $b$-vertex, and the number of colors is maximized. A $b$-vertex…

In this study, the Rank Genetic Algorithm was adapted to address a problem in the field of Chromatic Graph Theory, namely, on the parameter called the connected-pseudoachromatic index. We successfully improved several previously known…

In this paper we investigate the colorful components framework, motivated by applications emerging from comparative genomics. The general goal is to remove a collection of edges from an undirected vertex-colored graph $G$ such that in the…

Consider a graph whose vertices are colored in one of two colors, say black or white. A white vertex is called integrated if it has at least as many black neighbors as white neighbors, and similarly for a black vertex. The coloring as a…

The problem of computing induced subgraphs that satisfy some specified restrictions arises in various applications of graph algorithms and has been well studied. In this paper, we consider the following Balanced Connected Subgraph (shortly,…

We study the problem of coloring a given graph using a small number of colors in several well-established models of computation for big data. These include the data streaming model, the general graph query model, the massively parallel…

A Grundy k-coloring of a graph G, is a vertex k-coloring of G such that for each two colors i and j with i < j, every vertex of G colored by j has a neighbor with color i. The Grundy chromatic number (G), is the largest integer k for which…

Coloring unit-disk graphs efficiently is an important problem in the global and distributed setting, with applications in radio channel assignment problems when the communication relies on omni-directional antennas of the same power. In…

We resolve a number of long-standing open problems in online graph coloring. More specifically, we develop tight lower bounds on the performance of online algorithms for fundamental graph classes. An important contribution is that our…

Graph coloring, also known as vertex coloring, considers the problem of assigning colors to the nodes of a graph such that adjacent nodes do not share the same color. The optimization version of the problem concerns the minimization of the…

A map $c:V(G)\rightarrow\{1,\dots,k\}$ of a graph $G$ is a packing $k$-coloring if every two different vertices of the same color $i\in \{1,\dots,k\}$ are at distance more than $i$. The packing chromatic number $\chi_{\rho}(G)$ of $G$ is…

Can we efficiently compute optimal solutions to instances of a hard problem from optimal solutions to neighboring (i.e., locally modified) instances? For example, can we efficiently compute an optimal coloring for a graph from optimal…

Reciprocal best match graphs (RBMGs) are vertex colored graphs whose vertices represent genes and the colors the species where the genes reside. Edges identify pairs of genes that are most closely related with respect to an underlying…

A b-coloring of a graph is a proper coloring such that each color class has at least one vertex which is adjacent to each other color class. The b-spectrum of $G$ is the set $S_{b}(G)$ of integers $k$ such that $G$ has a b-coloring with $k$…

Motivated by sequential budgeted allocation problems, we investigate online matching problems where connections between vertices are not i.i.d., but they have fixed degree distributions -- the so-called configuration model. We estimate the…