Results 251 to 260 of about 1,522,114 (310)

Automated Aerospray Hematology PRO staining shows good agreement for mature leukocytes but limited diagnostic reliability for immature forms: comparison with manual May-Grünwald-Giemsa staining. [PDF]

Biochem Med (Zagreb)
Nikler A, Tomas M, Saračević A, Radišić Biljak V.   +3 more
europepmc   +1 more source

The growth rate of multicolor Ramsey numbers of 3-graphs. [PDF]

Res Math Sci
Bradač D, Fox J, Sudakov B.
europepmc   +1 more source

Making sense of expanding transcriptomic data: network-based approaches for studying reproduction in domestic and wild animal species. [PDF]

Front Vet Sci
Amelkina O, Comizzoli P.
europepmc   +1 more source

Quality detection and grading of peach fruit based on image processing method and neural networks in agricultural industry. [PDF]

Front Plant Sci
Luo D, Luo R, Cheng J, Liu X.
europepmc   +1 more source

Ultra-stable aqueous electrochromism based on [EMIM]⁺/I₃ ^- coordination. [PDF]

Chem Sci
Meng F, Zhong J, Tan X, Cheng J, Xiao B, Zhang S, Jiang F, Liu W, Liu W, Kang L.   +9 more
europepmc   +1 more source

An efficient swarm evolution algorithm with probability learning for the black and white coloring problem. [PDF]

Sci Rep
Zhang Z, Zhang L, Zhang X.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Graph Edge Coloring: A Survey

Graphs and Combinatorics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Cao, Guantao Chen, Guangming Jing, M. Stiebitz, B. Toft   +4 more
semanticscholar   +3 more sources

Arboricity-Dependent Algorithms for Edge Coloring

Scandinavian Workshop on Algorithm Theory, 2023
The problem of edge coloring has been extensively studied over the years. Recently, this problem has received significant attention in the dynamic setting, where we are given a dynamic graph evolving via a sequence of edge insertions and deletions and ...
Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon   +3 more
semanticscholar   +1 more source

Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time

arXiv.org, 2023
We consider the problem of maintaining a $(1+\epsilon)\Delta$-edge coloring in a dynamic graph $G$ with $n$ nodes and maximum degree at most $\Delta$.
Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon   +3 more
semanticscholar   +1 more source

Streaming Edge Coloring with Subquadratic Palette Size

International Colloquium on Automata, Languages and Programming, 2023
In this paper, we study the problem of computing an edge-coloring in the (one-pass) W-streaming model. In this setting, the edges of an $n$-node graph arrive in an arbitrary order to a machine with a relatively small space, and the goal is to design an ...
S. Chechik, Doron Mukhtar, Tianyi Zhang
semanticscholar   +1 more source