Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing

@inproceedings{Wood2002QueueLT,
  title={Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing},
  author={David R. Wood},
  booktitle={FSTTCS},
  year={2002}
}
  • D. Wood
  • Published in FSTTCS 12 December 2002
  • Mathematics
A three-dimensional (straight-line grid) drawing of a graph represents the vertices by points in Z3 and the edges by noncrossing line segments. This research is motivated by the following open problem due to Felsner, Liotta, and Wismath [Graph Drawing '01, Lecture Notes in Comput. Sci., 2002]: does every n-vertex planar graph have a three-dimensional drawing with O(n) volume? We prove that this question is almost equivalent to an existing one-dimensional graph layout problem. A queue layout… 
Layout of Graphs with Bounded Tree-Width
TLDR
It is proved that the queue-number is bounded by the tree-width, thus resolving an open problem due to Ganley and Heath and disproving a conjecture of Pemmaraju.
On the Queue Number of Planar Graphs
TLDR
The first non-trivial improvement of the upper bound on queue number of planar graphs from 49 to 42 is obtained, which is a breakthrough result.
New Results in Graph Layout
A track layout of a graph consists of a vertex colouring, an edge colouring, and a total order of each vertex colour class such that between each pair of vertex colour classes, there is no
Characterizations of Deque and Queue Graphs
TLDR
This paper shows that a graph is a deque graph if and only if it is the subgraph of a planar graph with a Hamiltonian path, and obtains that the dual of an embedded queue graph contains a Eulerian path.
Queue Layouts of Planar 3-Trees
TLDR
This work improves the upper bound to five and shows that there exist planar 3-trees, whose queue number is at least four; this is the first example of a planar graph with queue number greater than three.
Data Structures and their Planar Graph Layouts
In a stack layout, also known as book embedding, the vertices of a graph are placed on a line and an edge is a data item that is pushed on the stack at the left vertex and removed at the right
Stacks, Queues and Tracks: Layouts of Graph Subdivisions
TLDR
The best known upper bound on the number of division vertices per edge in a 3-stack subdivision of an n-vertex graph G is improved from O(log n) to O (log min\sn(G),qn(G) ), which reduces the question of whether queue-number is bounded by stack-number to whether 3- stack graphs have bounded queue number.
Queue Layout of Planar 3−Tree
TLDR
This thesis addresses various graph drawing techniques, their implementation, and enhancements, and implemented the queue layout of 2-Layer planar 3-Tree using two queues and generalized this experiment for any arbitrary number of levels.
On the Queue-Number of Graphs with Bounded Tree-Width
TLDR
It is shown that for each $k\geq1$ graphs with tree-width at most $k$ have queue-number at most £2^k-1, which improves upon double exponential upper bounds due to Dujmovic et al. and Giacomo et al and solves a problem of Rengarajan and Veni Madhavan.
Tree-Partitions of k-Trees with Applications in Graph Layout
TLDR
It is proved that graphs of bounded tree-width have bounded queue-number, thus resolving an open problem due to Ganley and Heath [2001] and disproving a conjecture of Pemmaraju [1992].
...
...

References

SHOWING 1-10 OF 38 REFERENCES
Tree-Partitions of k-Trees with Applications in Graph Layout
TLDR
It is proved that graphs of bounded tree-width have bounded queue-number, thus resolving an open problem due to Ganley and Heath [2001] and disproving a conjecture of Pemmaraju [1992].
Laying out Graphs Using Queues
TLDR
It is proved that the problem of recognizing 1-queue graphs is NP-complete and relationships between the queuenumber of a graph and its bandwidth and separator size are presented.
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs
TLDR
It is proved that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line grid drawing with O(pw( G)2?n) volume, and it follows that for graphs with bounded tree-width, such as series-parallel graphs, the volume is O(n log2 n).
Exploring the powers of stacks and queues via graph layouts
In this dissertation we employ graph layouts to explore the relative power of stacks and queues. We first present two tools that are useful in the combinatorial and algorithmic analysis of stack and
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
TLDR
This paper investigates restrictions of the integer grid in 3 dimensions and shows that every outerplanar graph with n vertices can be drawn crossing-free with straight lines in linear volume on a grid called a prism and that the extension to a n × 2 × 2 integer grid does not admit the entire class of planar graphs.
Planar graphs and poset dimension
We view the incidence relation of a graph G=(V. E) as an order relation on its vertices and edges, i.e. a<Gb if and only of a is a vertex and b is an edge incident on a. This leads to the definition
Three-dimensional Grid Drawings of Graphs
TLDR
It is shown that for any fixed r-colorable graph of n vertices, every three-dimensional grid drawing that fits into a box of volume O(n^2)$.
Graphs with E Edges Have Pagenumber O(sqrt(E))
  • S. Malitz
  • Mathematics, Computer Science
    J. Algorithms
  • 1994
TLDR
The main results are dramatic improvements over previously known bounds and any graph with E edges has pagenumber O (√E); there is a d -regular N -vertex graph with pagenumbers Ω(√ d N 1/2-1/ d ).
How to draw a planar graph on a grid
TLDR
It is shown that any setF, which can support a Fáry embedding of every planar graph of sizen, has cardinality at leastn+(1−o(1))√n which settles a problem of Mohar.
Graphs with E edges have pagenumber O(√E)
  • S. Malitz
  • Mathematics, Computer Science
    FOCS 1994
  • 1994
TLDR
There is a d-regular N-vertex graph with pagenumber Ω(√d N 1/2−1/d ).
...
...