| author: | William Evans and Mohammad Ali Safari |
|---|---|
| title: | Directed One-Trees |
| keywords: | tree-width, tree-decomposition, d-width, d-decomposition, and haven order. |
| abstract: |
We identify the class of directed one-trees and prove the
so-called min-max theorem for them. As a consequence, we
establish the equality of directed tree-width and a new
measure, d-width, on this class of graphs. In addition, we
prove a property of all directed one-trees and use this
property to create an
O(n
recognition algorithm and an
2
)
O(n
algorithm for solving the Hamiltonian cycle problem
on directed one-trees.
2
)
|
| If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files. | |
| reference: | William Evans and Mohammad Ali Safari (2005), Directed One-Trees , in 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), Stefan Felsner (ed.), Discrete Mathematics and Theoretical Computer Science Proceedings AE, pp. 67-72 |
| bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
| ps.gz-source: | dmAE0114.ps.gz (60 K) |
| ps-source: | dmAE0114.ps (145 K) |
| pdf-source: | dmAE0114.pdf (139 K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.