Results 31 to 40 of about 286,443 (288)
AKCE International Journal of Graphs and Combinatorics, 2020 Let and be two digraphs; without loops or multiple arcs. An coloring of is a function . We say that is an colored digraph. For an arc of , we say that is the color of over the coloring . A directed path in is an path if is a directed walk in .
Hortensia Galeana-Sánchez +1 more
doaj +1 more source
Colorful Image Colorization [PDF]
, 2016 Given a grayscale photograph as input, this paper attacks the problem of hallucinating a plausible color version of the photograph. This problem is clearly underconstrained, so previous approaches have either relied on significant user interaction or resulted in desaturated colorizations.
Zhang, Richard +2 more
openaire +2 more sources
Normal 6-edge-colorings of some bridgeless cubic graphs
, 2019 In an edge-coloring of a cubic graph, an edge is poor or rich, if the set of colors assigned to the edge and the four edges adjacent it, has exactly five or exactly three distinct colors, respectively.
Mazzuoccolo, Giuseppe, Mkrtchyan, Vahan
core +1 more source
Vertex-Coloring 2-Edge-Weighting of Graphs [PDF]
, 2010 A $k$-{\it edge-weighting} $w$ of a graph $G$ is an assignment of an integer weight, $w(e)\in \{1,\dots, k\}$, to each edge $e$. An edge weighting naturally induces a vertex coloring $c$ by defining $c(u)=\sum_{u\sim e} w(e)$ for every $u \in V(G)$. A $k$
Lu, Hongliang +2 more
core
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background The delipid extracorporeal lipoprotein filter from plasma (DELP) treatment can effectively reduce blood lipid, increase blood flow, and improve neurological deficits in patients with acute ischemic stroke (AIS). However, its effect on vision and retinal microcirculation in stroke patients has never been reported.
Ning Li +9 more
wiley +1 more source
Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence [PDF]
, 2010 We study the {edge-coloring} problem in the message-passing model of distributed computing. This is one of the most fundamental and well-studied problems in this area.
Barenboim, Leonid, Elkin, Michael
core
Data Reduction for Graph Coloring Problems
, 2013 This paper studies the kernelization complexity of graph coloring problems with respect to certain structural parameterizations of the input instances. We are interested in how well polynomial-time data reduction can provably shrink instances of coloring
Bart M.P. Jansen +30 more
core +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Chronic kidney disease is a growing public health problem worldwide, and the number of patients requiring renal replacement therapy is steadily increasing. Türkiye has experienced a similar rise in both the incidence and prevalence of renal replacement therapy over the past decades; however, national‐level projections of future ...
Arzu Akgül +2 more
wiley +1 more source
Nanomaterials, 2023 Optically resonant silicon nanoparticles have emerged as a prospective platform for the structural coloration of surfaces because of their strong and spectrally selective light scattering.
Lev Logunov +6 more
doaj +1 more source
Oriented coloring on recursively defined digraphs
, 2019 Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph G=(V,A)
Gurski, Frank +2 more
core +1 more source