Results 141 to 150 of about 20,892 (173)

Optimizing Time-Sensitive Traffic Scheduling in Low-Earth-Orbit Satellite Networks. [PDF]

Sensors (Basel)
Liu W, Xiao N, Liu B, Zhang Y, Li T.
europepmc   +1 more source

Timely Updating on Ber/Geo/1/2 Queue Modeled Status Updating System with Eavesdropper. [PDF]

Entropy (Basel)
Zhang J, Xu H, Zheng A, Cao D, Xu Y, Lin C.   +5 more
europepmc   +1 more source

Does GLUT4 Queue? A Mechanistic Mathematical Model for Insulin Response in Adipocytes. [PDF]

Bull Math Biol
Sherlock BD, Boon MAA, Vlasiou M, Coster ACF.   +3 more
europepmc   +1 more source

Supplying whole blood with drones for prehospital transfusion at trauma sites in Finland: A simulation. [PDF]

Vox Sang
Erästö P, Juntunen M, Pappinen J, Nurmi J, Ihalainen J, Lauronen J, Arvas M.   +6 more
europepmc   +1 more source

Discrete Event Simulation-Based Analysis and Optimization of Emergency Patient Scheduling Strategies. [PDF]

Healthcare (Basel)
Lv W, Liu R, Yan F, Wang Y.
europepmc   +1 more source

LncRNA regulation of pyroptosis determines prognostic outcomes and functional characteristics in liver cancer. [PDF]

Discov Oncol
Zhang R, Zhang C, Zhang J, Lv N, Zhang Y.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Planar Graphs of Bounded Degree Have Bounded Queue Number

SIAM Journal on Computing, 2019
Summary: A \textit{queue layout} of a graph consists of a \textit{linear order} of its vertices and a partition of its edges into \textit{queues}, so that no two independent edges of the same queue are nested. The \textit{queue number} of a graph is the minimum number of queues required by any of its queue layouts. A long-standing conjecture by \textit{
Michael A Bekos, Martin Gronemann, Tamara Mchedlidze   +2 more
exaly   +3 more sources

Stack and queue number of 2-trees

1995
We consider the two problems of embedding graphs in a minimum number of pages and ordering the vertices of graphs in the form of queue layouts. We show that the class of 2-trees requires 2-pages for a book embedding and 3-queues for a queue layout. The first result is new and the latter result extends known results on subclasses of planar graphs.
S. Rengarajan, C. E. Veni Madhavan
openaire   +1 more source