How to Use
Select graph:
- qn: Queue number
- Layout: Vertex order + queues
- Compare: qn vs bt
2020 Breakthrough
Open for 30+ years: do planar graphs have bounded queue number? Dujmović et al. proved qn(planar) ≤ 49 using layered treewidth. Extended to bounded-genus, minor-free graphs. One of the biggest results in graph drawing.
Queue vs Stack
Stack layout (book embedding): LIFO, no crossings on page. Queue layout: FIFO, no nesting. These capture different linear structures. Stack number can differ greatly from queue number for the same graph.
Step-by-Step Instructions
- 1Select graph.
- 2Compute qn(G).
- 3Find queue layout.
- 4Compare to bt.
- 5Check bounds.