Layout of Graphs with Bounded Tree-Width

@article{Dujmovic2005LayoutOG,
  title={Layout of Graphs with Bounded Tree-Width},
  author={Vida Dujmovic and Pat Morin and David R. Wood},
  journal={SIAM J. Comput.},
  year={2005},
  volume={34},
  pages={553-579}
}
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its queue-number. A three-dimensional (straightline grid) drawing of a graph represents the vertices by points in Z3 and the edges by non-crossing line-segments. This paper contributes three main results: (1) It is proved that the minimum volume of a certain type of three… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
6 Extracted Citations
91 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 91 references

Similar Papers

Loading similar papers…