Queue number

A de Bruijn graph. With the vertex ordering shown, the partition of the edges into two subsets looping around the left and right sides of the drawing is a 2-queue layout of this graph.

In mathematics, the queue number of a graph is a graph invariant defined analogously to stack number (book thickness) using first-in first-out (queue) orderings in place of last-in first-out (stack) orderings.

Definition

A queue layout of a given graph is defined by a total ordering of the vertices of the graph together with a partition of the edges into a number of "queues". The set of edges in each queue is required to avoid edges that are properly nested: if ab and cd are two edges in the same queue, then it should not be possible to have a < c < d < b in the vertex ordering. The queue number qn(G) of a graph G is the minimum number of queues in a queue layout.[1]

Equivalently, from a queue layout, one could process the edges in a single queue using a queue data structure, by considering the vertices in their given ordering, and when reaching a vertex, dequeueing all edges for which it is the second endpoint followed by enqueueing all edges for which it is the first endpoint. The nesting condition ensures that, when a vertex is reached, all of the edges for which it is the second endpoint are ready to be dequeued.[1] Another equivalent definition of queue layouts involves embeddings of the given graph onto a cylinder, with the vertices placed on a line in the cylinder and with each edge wrapping once around the cylinder. Edges that are assigned to the same queue are not allowed to cross each other, but crossings are allowed between edges that belong to different queues.[2]

Queue layouts were defined by Heath & Rosenberg (1992), by analogy to previous work on book embeddings of graphs, which can be defined in the same way using stacks in place of queues. As they observed, these layouts are also related to earlier work on sorting permutations using systems of parallel queues, and may be motivated by applications in VLSI design and in communications management for distributed algorithms.[1]

Graph classes with bounded queue number

Every tree has queue number 1, with a vertex ordering given by a breadth-first traversal.[3] Pseudoforests and grid graphs also have queue number 1.[4] Outerplanar graphs have queue number at most 2; the 3-sun graph (a triangle with each of its edges replaced by a triangle) is an example of an outerplanar graph whose queue number is exactly 2.[5] Series-parallel graphs have queue number at most 3.[6]

Binary de Bruijn graphs have queue number 2.[7] The d-dimensional hypercube graph has queue number at most d − 1.[8] The queue numbers of complete graphs Kn and complete bipartite graphs Ka,b are known exactly: they are and respectively.[9]

Unsolved problem in mathematics:
Does every planar graph have bounded queue number?
(more unsolved problems in mathematics)

Every 1-queue graph is a planar graph, with an "arched leveled" planar embedding in which the vertices are placed on parallel lines (levels) and each edge either connects vertices on two consecutive levels or forms an arch that connects two vertices on the same level by looping around all previous levels. Conversely, every arched leveled planar graph has a 1-queue layout.[10] Heath, Leighton & Rosenberg (1992) conjectured that every planar graph has bounded queue number, but this remains unsolved. If the queue number of planar graphs is bounded, then the same is true for 1-planar graphs and more generally k-planar graphs.[11] The strongest known bound on the queue number of planar graphs is not constant, but O(log n).[12] Polylogarithmic bounds on the queue number are also known for graphs of bounded genus and more generally graphs in any minor-closed graph family.[13]

Using a variation of queue number called the strong queue number, the queue number of a graph product can be bounded by a function of the queue numbers and strong queue numbers of the factors in the product.[14]

Graphs with low queue number are sparse graphs: 1-queue graphs with n vertices have at most 2n − 3 edges,[15] and more generally graphs with queue number q have at most 2qn − q(2q + 1) edges.[16] This implies that these graphs also have small chromatic number: in particular 1-queue graphs are 3-colorable, and graphs with queue number q may need at least 2q + 1 and at most 4q colors.[16] In the other direction, a bound on the number of edges implies a much weaker bound on the queue number: graphs with n vertices and m edges have queue number at most O(√m).[17] This bound is close to tight, because for random d-regular graphs the queue number is, with high probability,

[18]
Unsolved problem in mathematics:
Must every graph with bounded queue number also have bounded book thickness, and vice versa?
(more unsolved problems in mathematics)

Graphs with queue number 1 have book thickness at most 2.[19] For any fixed vertex ordering, the product of the book thickness and queue numbers for that ordering is at least as large as the cutwidth of the graph divided by its maximum degree.[19] The book thickness may be much larger than the queue number: ternary Hamming graphs have logarithmic queue number but polynomially-large book thickness.[19] It remains unknown whether the book thickness can be bounded by any function of the queue number. Heath, Leighton & Rosenberg (1992) conjectured that the queue number is at most a linear function of the book thickness, but no functional bound in this direction is known either. It is known that, if all bipartite graphs with 3-page book embeddings have bounded queue number, then all graphs with bounded book thickness have bounded queue number.[11]

Ganley & Heath (2001) asked whether the queue number of a graph could be bounded as a function of its treewidth, and cited an unpublished Ph.D. dissertation of S. V. Pemmaraju as providing evidence that the answer was no: planar 3-trees appeared from this evidence to have unbounded queue number. However, the queue number was subsequently shown to be bounded by a (doubly exponential) function of the treewidth.[20]

Computational complexity

It is NP-complete to determine the queue number of a given graph, or even to test whether this number is one.[21]

However, if the vertex ordering of a queue layout is given as part of the input, then the optimal number of queues for the layout equals the maximum number of edges in a k-rainbow, a set of k edges each two of which form a nested pair. A partition of edges into queues can be performed by assigning an edge e that is the outer edge of an i-rainbow (and of no larger rainbow) to the ith queue. It is possible to construct an optimal layout in time O(m log log n), where n denotes the number of vertices of the input graph and m denotes the number of edges.[22]

Graphs of bounded queue number also have bounded expansion, meaning that their shallow minors are sparse graphs with a ratio of edges to vertices (or equivalently degeneracy or arboricity) that is bounded by a function of the queue number and the depth of the minor. As a consequence, several algorithmic problems including subgraph isomorphism for pattern graphs of bounded size have linear time algorithms for these graphs.[23] More generally, because of their bounded expansion, it is possible to check whether any sentence in the first-order logic of graphs is valid for a given graph of bounded queue number, in linear time.[24]

Application in graph drawing

Although queue layouts do not necessarily produce good two-dimensional graph drawings, they have been used for three-dimensional graph drawing. In particular, a graph G has bounded queue number if and only if it is possible to place the vertices of G in a three-dimensional grid of dimensions O(n) × O(1) × O(1) in such a way that no two edges cross each other.[25] Thus, for instance, de Bruijn graphs and graphs of bounded treewidth have three-dimensional embeddings of linear volume.[26]

Logarithmic or polylogarithmic bounds on the queue number translate in the same way into 3d embeddings with near-linear volume, in a grid with one dimension linear and the other two polylogarithmic. Planar graphs, bounded genus graphs, and graphs of bounded local treewidth have embeddings of volume O(n log n),[12] while graphs in minor-closed families have embeddings of volume O(n logO(1) n).[13]

Notes

  1. 1 2 3 Heath & Rosenberg (1992).
  2. ↑ Auer et al. (2011).
  3. ↑ Heath & Rosenberg (1992), Proposition 4.1.
  4. ↑ Heath & Rosenberg (1992), Propositions 4.2 and 4.3.
  5. ↑ Heath, Leighton & Rosenberg (1992); Rengarajan & Veni Madhavan (1995).
  6. ↑ Rengarajan & Veni Madhavan (1995).
  7. ↑ Heath & Rosenberg (1992), Proposition 4.6.
  8. ↑ Heath & Rosenberg (1992), Proposition 4.10; Hasunuma & Hirota (2007); Pai, Chang & Wang (2008); Gregor, Škrekovski & Vukašinović (2011).
  9. ↑ Heath & Rosenberg (1992), Propositions 4.7 and 4.8.
  10. ↑ Heath & Rosenberg (1992), Theorem 3.2.
  11. 1 2 Dujmović & Wood (2005).
  12. 1 2 Dujmović (2015), improving an earlier bound of Di Battista, Frati & Pach (2013).
  13. 1 2 Dujmović, Morin & Wood (2013).
  14. ↑ Wood (2005).
  15. ↑ Heath & Rosenberg (1992), Theorem 3.6
  16. 1 2 Dujmović & Wood (2004).
  17. ↑ Heath, Leighton & Rosenberg (1992). A polynomial-time algorithm for finding a layout with close to this many queues is given by Shahrokhi & Shi (2000). Dujmović & Wood (2004) improved the constant factor in this bound to e√m, where e is the base of the natural logarithm.
  18. ↑ Heath, Leighton & Rosenberg (1992); Wood (2008).
  19. 1 2 3 Heath, Leighton & Rosenberg (1992).
  20. ↑ Dujmović & Wood (2003); Dujmović, Morin & Wood (2005). See Wood (2002) for a weaker preliminary result, bounding the queue number by the pathwidth or by a combination of treewidth and degree.
  21. ↑ Heath & Rosenberg (1992), Corollary 3.9.
  22. ↑ Heath & Rosenberg (1992), Theorem 2.3.
  23. ↑ Nešetřil, Ossona de Mendez & Wood (2012); Nešetřil & Ossona de Mendez (2012), pp. 321–327.
  24. ↑ Nešetřil & Ossona de Mendez (2012), Theorem 18.2, p. 401.
  25. ↑ Wood (2002); Dujmović, Pór & Wood (2004); Dujmović, Morin & Wood (2005). See Di Giacomo & Meijer (2004) for tighter bounds on the grid dimensions for graphs of small queue number.
  26. ↑ Dujmović & Wood (2003); Dujmović, Morin & Wood (2005).

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.