Results 231 to 240 of about 129,100 (297)

Characterization of the Complete Mitogenomes of Four Dacinae Species (Diptera: Tephritidae) with Phylogenetic Analysis. [PDF]

Animals (Basel)
Xu D, Ding S, Zeng X, Du L.
europepmc   +1 more source

Optimal Molecular Design: Generative Active Learning Combining REINVENT with Precise Binding Free Energy Ranking Simulations. [PDF]

J Chem Theory Comput
Loeffler HH, Wan S, Klähn M, Bhati AP, Coveney PV.   +4 more
europepmc   +1 more source

Solving multi-scenario hybrid flow shop scheduling problem based on an improved probe machine model. [PDF]

PLoS One
Tian X, Kong Y, Liu X.
europepmc   +1 more source

A passage time for greedy‐coloring cycles

Random Structures & Algorithms, 1995
AbstractWe consider the progress of the greedy vertex coloring algorithm applied to cycle graphs. In particular we study the asymptotic distribution of the number of vertices colored by the algorithm when the third color is first used (if it is).
J. Preater
semanticscholar   +3 more sources

A matched approximation bound for the sum of a greedy coloring

Information Processing Letters, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz   +2 more
semanticscholar   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

The connected greedy coloring game

Theoretical Computer Science, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carlos V.G.C. Lima, Thiago Marcilon, Nicolas Martins, Rudini Sampaio   +3 more
openaire   +2 more sources

ALGORITMA GREEDY COLORING PADA WEBSITE ENSIKLOPEDIA PETA

Jurnal Ilmiah Teknologi dan Rekayasa
Graph coloring is used, because the results of graph coloring can be used in several systems, such as the scheduling and the coloring of map areas in this study. The goal in implementing graph coloring here is to get as few colors as possible in the 44 borders of villages in Jakarta Pusat.
Ibnu Aldi Nugroho, null Fauziah, Nur Hayati   +2 more
openaire   +2 more sources

The greedy coloring is a bad probabilistic algorithm

Journal of Algorithms, 1991
\textit{G. R. Grimmett} and \textit{C. J. H. McDiarmid} [Math. Proc. Cambridge philos. Soc. 77, 313-324 (1975; Zbl 0297.05112)] proved that almost all graphs with \(n\) vertices have chromatic number at least \((1-O(1)){n \over 2\log_ 2 n}\), and almost all graphs with \(n\) vertices are coloured by the greedy algorithm using less than \((1+O(1)){n ...
L. Kučera
openaire   +2 more sources

Radio Resource Allocation for RIS-aided D2D Communication Based on Greedy Hypergraph-with-weight Coloring

Asia-Pacific Network Operations and Management Symposium, 2021
Device-to-Device (D2D) is a very promising technology which can significantly improved the spectral efficiency, while the communication distance is often limited by resource constraints.
Tang Liu, Lei Feng, Wenjing Li, Zhixiang Yang   +3 more
openalex   +2 more sources