Related papers: Generalized Divide and Color models
Locally finding a solution to symmetry-breaking tasks such as vertex-coloring, edge-coloring, maximal matching, maximal independent set, etc., is a long-standing challenge in distributed network computing. More recently, it has also become…
The generalized Fleming-Viot processes were defined in 1999 by Donnelly and Kurtz using a particle model and by Bertoin and Le Gall in 2003 using stochastic flows of bridges. In both methods, the key argument used to characterize these…
While many image colorization algorithms have recently shown the capability of producing plausible color versions from gray-scale photographs, they still suffer from limited semantic understanding. To address this shortcoming, we propose to…
We investigate the classical and distributed complexity of \emph{$k$-partial $c$-coloring} where $c=k$, a natural generalization of Brooks' theorem where each vertex should be colored from the palette $\{1,\ldots,c\} = \{1,\ldots,k\}$ such…
In this work we introduce a new type of urn model with infinite but countable many colors indexed by an appropriate infinite set. We mainly consider the indexing set of colors to be the $d$-dimensional integer lattice and consider balanced…
In 1980, Albertson and Berman introduced partial coloring. In 2000, Albertson, Grossman, and Haas introduced partial list coloring. Here, we initiate the study of partial coloring for an insightful generalization of list coloring introduced…
Species sampling processes have long served as the fundamental framework for modeling random discrete distributions and exchangeable sequences. However, data arising from distinct but related sources require a broader notion of…
We tackle three optimization problems in which a colored graph, where each node is assigned a color, must be partitioned into colorful connected components. A component is defined as colorful if each color appears at most once. The problems…
The complexity of distributed edge coloring depends heavily on the palette size as a function of the maximum degree $\Delta$. In this paper we explore the complexity of edge coloring in the LOCAL model in different palette size regimes. 1.…
Cell instance segmentation is critical to analyzing biomedical images, yet accurately distinguishing tightly touching cells remains a persistent challenge. Existing instance segmentation frameworks, including detection-based, contour-based,…
NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a…
Image colorization is inherently an ill-posed problem with multi-modal uncertainty. Previous methods leverage the deep neural network to map input grayscale images to plausible color outputs directly. Although these learning-based methods…
This paper explores the application of a new algebraic method of color exchanges to the edge coloring of simple graphs. Vizing's theorem states that the edge coloring of a simple graph $G$ requires either $\Delta$ or $\Delta+1$ colors,…
We analyse uniformly random proper $k$-colourings of sparse graphs with maximum degree $\Delta$ in the regime $\Delta < k\ln k $. This regime corresponds to the lower side of the shattering threshold for random graph colouring, a…
One of the fundamental and most-studied algorithmic problems in distributed computing on networks is graph coloring, both in bounded-degree and in general graphs. Recently, the study of this problem has been extended in two directions.…
Recently, Hirschhorn and Sellers defined the partition function $a_r(n)$, which counts the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may appear in one of $r$-colors for fixed $r\ge1$. The aim…
Identifying the sets of operations that can be executed simultaneously is an important problem appearing in many parallel applications. By modeling the operations and their interactions as a graph, one can identify the independent…
In 1970 Hajnal and Szemer\'edi proved a conjecture of Erd\"os that for a graph with maximum degree $\Delta$, there exists an equitable $\Delta+1$ coloring; that is a coloring where color class sizes differ by at most $1$. In 2007 Kierstand…
In this paper, we obtain additional results for a fractional counting process introduced and studied by Di Crescenzo et al. (2016). For convenience, we call it the generalized fractional counting process (GFCP). It is shown that the…
The research interest of this paper is focused on the efficient clustering task for an arbitrary color data. In order to tackle this problem, we have tried to model the inherent uncertainty and vagueness of color data using fuzzy color…