Related papers: Edge coloring in unstructured CFD codes
Partitioning an image into superpixels based on the similarity of pixels with respect to features such as colour or spatial location can significantly reduce data complexity and improve subsequent image processing tasks. Initial algorithms…
Computing the gradient of an image is a common step in computer vision pipelines. The image gradient quantifies the magnitude and direction of edges in an image and is used in creating features for downstream machine learning tasks.…
We present a set of rules to guide the design of GPU algorithms. These rules are grounded on the principle of reducing waste in GPU utility to achieve good speed up. In accordance to these rules, we propose GPU algorithms for 2D…
Given a graph $G$ and a positive integer $d$, an orthogonal vector $d$-coloring of $G$ is an assignment $f$ of vectors of $\mathbb{R}^d$ to $V(G)$ in such a way that adjacent vertices receive orthogonal vectors. The orthogonal chromatic…
In the context of communication complexity, we explore protocols for graph coloring, focusing on the vertex and edge coloring problems in $n$-vertex graphs $G$ with a maximum degree $\Delta$. We consider a scenario where the edges of $G$…
We propose a new method for producing color images from sketches. Current solutions in sketch colorization either necessitate additional user instruction or are restricted to the "paired" translation strategy. We leverage semantic image…
Many forms of programmable matter have been proposed for various tasks. We use an abstract model of self-organizing particle systems for programmable matter which could be used for a variety of applications, including smart paint and…
A graph $G$ is said to be $d$-distinguishable if there is a vertex coloring of $G$ with a set of $d$ colors which breaks all of the automorphisms of $G$ but the identity. We call the minimum $d$ for which a graph $G$ is $d$-distinguishiable…
In a simple, undirected graph G, an edge 2-coloring is a coloring of the edges such that no vertex is incident to edges with more than 2 distinct colors. The problem maximum edge 2-coloring (ME2C) is to find an edge 2-coloring in a graph G…
Maxwell interface problems are of great importance in many electromagnetic applications. Unfitted mesh methods are especially attractive in 3D computation as they can circumvent generating complex 3D interface-fitted meshes. However, many…
A {\bf $\mathbf{k}$-majority coloring} of a digraph $D=(V,A)$ is a coloring of $V$ with $k$ colors so that each vertex $v\in V$ has at least as many out-neighbours of color different from its own color as it has out-neighbours with the same…
We combine the ideas of edge coloring games and asymmetric graph coloring games and define the \emph{$(m,1)$-edge coloring game}, which is alternatively played by two players Maker and Breaker on a finite simple graph $G$ with a set of…
The classical Weisfeiler-Leman algorithm aka color refinement is fundamental for graph learning with kernels and neural networks. Originally developed for graph isomorphism testing, the algorithm iteratively refines vertex colors. On many…
Bundling of graph edges (node-to-node connections) is a common technique to enhance visibility of overall trends in the edge structure of a large graph layout, and a large variety of bundling algorithms have been proposed. However, with…
A coloring of edges of a graph $G$ is injective if for any two distinct edges $e_1$ and $e_2$, the colors of $e_1$ and $e_2$ are distinct if they are at distance $1$ in $G$ or in a common triangle. Naturally, the injective chromatic index…
A simple and efficient algorithm to numerically compute the genus of surfaces of three-dimensional objects using the Euler characteristic formula is presented. The algorithm applies to objects obtained by thresholding a scalar field in a…
As in various fields like scientific research and industrial application, the computation time optimization is becoming a task that is of increasing importance because of its highly parallel architecture. The graphics processing unit is…
Image colorization methods have shown prominent performance on natural images. However, since humans are more sensitive to faces, existing methods are insufficient to meet the demands when applied to facial images, typically showing…
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…
Imaging is critical to the characterisation of materials. However, even with careful sample preparation and microscope calibration, imaging techniques are often prone to defects and unwanted artefacts. This is particularly problematic for…