Live briefing
Everything about Queue number
Invariant in graph theory
In the mathematical field of graph theory, the queue number of a graph is a graph invariant defined analogously to stack number using first-in first-out (queue) orderings in place of last-in first-out (stack) orderings. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Queue numberA 5-minute orientation
- Skim a recent paper: An Improved Upper Bound on the Queue Number of Planar GraphsInfluential work since 2022
- Pick up a classic book: Number 70, BerlinThe most-reprinted book on the subject
- Read the landmark paper: Planar Graphs Have Bounded Queue-NumberCited 68 times
- Go sideways: Book embeddingA closely related topic
- Go sideways: Bounded expansionA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Planar Graphs Have Bounded Queue-Number
An M/PH/k retrial queue with finite number of sources
NUMBER OF RETRIALS IN A FINITE SOURCE RETRIAL QUEUE WITH UNRELIABLE SERVER
On the Queue Number of Planar Graphs
Optimal trajectory to overflow in a queue fed by a large number of sources
A multiserver retrial queue with a finite number of sources of primary calls
A Time-Sharing Queue with a Finite Number of Customers
On the Queue-Number of Graphs with Bounded Tree-Width
🆕 Influential since 2022
An Improved Upper Bound on the Queue Number of Planar Graphs
Analysis of a multi-server retrial queue with a varying finite number of sources
An improved upper bound on the queue number of the folded hypercube
Discrete-Time Informal Queue with an Infinite Number of Groups for Resource Management of a Data Center
Analysis of Fuzzy Priority Queue with Unique Service using LR Fuzzy Number
📚 Books worth reading
Number 70, BerlinWilliam Le Queux · 1916
Structure and Interpretation of Computer Programs (SICP)Harold Abelson, Gerald Jay Sussman · 1985
Introduction to operations researchFrederick S. Hillier · 1967
Data structures and algorithm analysis in CMark Allen Weiss · 1993
Bayesian analysis of stochastic process modelsFabrizio Ruggeri · 2012
Data structures & algorithm analysis in JavaMark Allen Weiss · 1999
Mathematical Adventures in Performance AnalysisEitan Bachmat · 2014
Fundamentals of data structures in CEllis Horowitz · 1993
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Book embedding In graph theory, a book embedding is a generalization of planar embedding of a graph to embeddings in a book, a collection of half-planes all having the…
- Bounded expansion In graph theory, a family of graphs is said to have bounded expansion if all of its shallow minors are sparse graphs. Many natural families of sparse graphs…
- Strong product of graphs In graph theory, the strong product is a way of combining two graphs to make a larger graph. Two vertices are adjacent in the strong product when they…
- Slope number In graph drawing and geometric graph theory, the slope number of a graph is the minimum possible number of distinct slopes of edges in a drawing of the…
- Pathwidth In graph theory, a path decomposition of a graph G is, informally, a representation of G as a "thickened" path graph, and the pathwidth of G is a number…
- Twin-width The twin-width of an undirected graph is a natural number associated with the graph, used to study the parameterized complexity of graph algorithms. Intuitively…
- Holt graph In graph theory, the Holt graph or Doyle graph is the smallest half-transitive graph, that is, the smallest example of a vertex-transitive and edge-transitive…
- Star coloring In the mathematical field of graph theory, a star coloring of a graph G is a (proper) vertex coloring in which every path on four vertices uses at least…