Results 301 to 310 of about 9,663,355 (323)

Non‐Physician Contributors to Patient Satisfaction: Insights for Strengthening Philippine Primary Care

open access: yes
Journal of General and Family Medicine, Volume 27, Issue 1, January 2026.
Jeff Clyde G. Corpuz
wiley   +1 more source

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   +6 more
openaire   +3 more sources

Stack and queue number of 2-trees

International Computing and Combinatorics Conference, 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   +2 more sources

A Finite Source Retrial Queue: Number of Retrials

Communications in Statistics - Theory and Methods, 2013
We consider a single-server queuing system with a finite number of sources, where customers are not allowed to queue; instead of that, they make repeated attempts, or retrials, in order to enter service after some time. This queuing system and its variants are widely used to model disk memory systems, star-like local area networks, and other ...
V. Dragieva
openaire   +2 more sources

Three-Dimensional Graph Products with Unbounded Stack-Number

Discrete & Computational Geometry, 2022
We prove that the stack-number of the strong product of three n -vertex paths is $$\Theta (n^{1/3})$$ Θ ( n 1 / 3 ) . The best previously known upper bound was O ( n ). No non-trivial lower bound was known.
D. Eppstein   +5 more
semanticscholar   +1 more source

Queue Length Estimation for Signalized Intersections Using License Plate Recognition Data

IEEE Intelligent Transportation Systems Magazine, 2019
Queue length is an important variable in evaluating the performance of traffic management systems, especially under congested conditions. This problem has been studied in the literature based on different kinds of traffic sensors, such as loop detectors ...
Xiaoqin Luo   +4 more
semanticscholar   +1 more source

Bayesian inference and prediction in single server M/M/1 queuing model based on queue length

Communications in statistics. Simulation and computation, 2019
This paper is concerned with the problem of estimating traffic intensity, ρ for single server queuing model in which inter-arrival and service times are exponentially distributed (Markovian) using data on queue size (number of customers present in the ...
Arpita Basak, Amit Choudhury
semanticscholar   +1 more source

An improved upper bound on the queuenumber of the hypercube

Information Processing Letters, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hasunuma, Toru, Hirota, Misa
openaire   +2 more sources

Upper bounds on the queuenumber of k-ary n-cubes

Information Processing Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pai K.-J., Chang J.-M., Wang Y.-L.
openaire   +2 more sources

A Note on “An improved upper bound on the queuenumber of the hypercube”

Information Processing Letters, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pai, K.-J., Chang, J.-M., Wang, Y.-L.
openaire   +2 more sources

Home - About - Disclaimer - Privacy