Related papers: Online Edge Coloring Algorithms via the Nibble Met…
Erd\"os conjectured that if $G$ is a triangle free graph of chromatic number at least $k\geq 3$, then it contains an odd cycle of length at least $k^{2-o(1)}$ \cite{sudakovverstraete, verstraete}. Nothing better than a linear bound…
Let $\Delta(G)$ and $\chi'(G)$ be the maximum degree and chromatic index of a graph $G$, respectively. Appearing in different forms, Gupta\,(1967), Goldberg\,(1973), Andersen\,(1977), and Seymour\,(1979) made the following conjecture: Every…
In the $\ell$-Coloring Problem, we are given a graph on $n$ nodes, and tasked with determining if its vertices can be properly colored using $\ell$ colors. In this paper we study below-guarantee graph coloring, which tests whether an…
The online-LOCAL and SLOCAL models are extensions of the LOCAL model where nodes are processed in a sequential but potentially adversarial order. So far, the only problem we know of where the global memory of the online-LOCAL model has an…
We present a procedure for efficiently sampling colors in the {\congest} model. It allows nodes whose number of colors exceeds their number of neighbors by a constant fraction to sample up to $\Theta(\log n)$ semi-random colors unused by…
In the setting of online algorithms, the input is initially not present but rather arrive one-by-one over time and after each input, the algorithm has to make a decision. Depending on the formulation of the problem, the algorithm might be…
In the Edge Coloring problem, we are given an undirected graph $G$ with $n$ vertices and $m$ edges, and are tasked with finding the smallest positive integer $k$ so that the edges of $G$ can be assigned $k$ colors in such a way that no two…
In this paper we study the number of vertex recolorings that an algorithm needs to perform in order to maintain a proper coloring of a graph under insertion and deletion of vertices and edges. We present two algorithms that achieve…
The last five years of research on distributed graph algorithms have seen huge leaps of progress, both regarding algorithmic improvements and impossibility results: new strong lower bounds have emerged for many central problems and…
Given a graph $G$ and color set $\{1, \ldots, k\}$, a $\textit{proper coloring}$ is an assignment of a color to each vertex of $G$ such that no two vertices connected by an edge are given the same color. The problem of drawing a proper…
We propose a new partial-observability model for online learning problems where the learner, besides its own loss, also observes some noisy feedback about the other actions, depending on the underlying structure of the problem. We represent…
In this paper, we investigate the problem of graph list colouring in the on-line setting. We provide several results on paintability of graphs in the model introduced by Schauz [13] and Zhu [20]. We prove that the on-line version of Ohba's…
We study a generalisation of Vizing's theorem, where the goal is to simultaneously colour the edges of graphs $G_1,\dots,G_k$ with few colours. We obtain asymptotically optimal bounds for the required number of colours in terms of the…
We give a randomized algorithm that properly colors the vertices of a triangle-free graph G on n vertices using O(\Delta(G)/ log \Delta(G)) colors, where \Delta(G) is the maximum degree of G. The algorithm takes O(n\Delta2(G)log\Delta(G))…
Coloring is a notoriously hard problem, and even more so in the online setting, where each arriving vertex has to be colored immediately and irrevocably. Already on trees, which are trivially two-colorable, it is impossible to achieve…
Online optimization has emerged as powerful tool in large scale optimization. In this paper, we introduce efficient online algorithms based on the alternating directions method (ADM). We introduce a new proof technique for ADM in the batch…
We settle the complexity of the $(\Delta+1)$-coloring and $(\Delta+1)$-list coloring problems in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both problems running in a constant number of rounds. This…
As artificial intelligence (AI) applications continue to expand in next-generation networks, there is a growing need for deep neural network (DNN) models. Although DNN models deployed at the edge are promising for providing AI as a service…
We consider the problem of online graph colouring. Whenever a node is requested, a colour must be assigned to the node, and this colour must be different from the colours of any of its neighbours. According to the greedy algorithm the node…
Graph coloring is fundamental to distributed computing. We give the first sub-logarithmic distributed algorithm for coloring cluster graphs. These graphs are obtained from the underlying communication network by contracting nodes and edges,…