✦ LIBER ✦

Direction trees

✍ Scribed by Robert E. Jamison

Book ID: 105489532
Publisher: Springer
Year: 1987
Tongue: English
Weight: 301 KB
Volume: 2
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02187882

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Preferred direction Steiner trees

✍ Yildiz, M.C.; Madden, P.H. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 320 KB

Simple directed trees

✍ R.H. Johnson 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 913 KB

efinition. Let G be a graph arr$ assume s, .L z, w are distinct points of V(G) such that ((A,, \_J+) = XJ' and I: :, v-9) = w are in A(G) but (x, w) = SW and Tz, ,\*) = Ic\_ v are not isl,4(G). A DLW~~Y t to G is the replacement of XJ and tw by xw mb r\_v. The a+~v ~myh so obtained is denoted by rC.

Directed Tree-Width

✍ Thor Johnson; Neil Robertson; P.D. Seymour; Robin Thomas 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 198 KB

We generalize the concept of tree-width to directed graphs and prove that every directed graph with no ``haven'' of large order has small tree-width. Conversely, a digraph with a large haven has large tree-width. We also show that the Hamilton cycle problem and other NP-hard problems can be solved i

On the Realization of Directed Trees and

On the Realization of Directed Trees and Directed 2-Trees

✍ Wai-Kai Chen 📂 Article 📅 1966 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 425 KB

Introducing Directed Tree Width

✍ B. Reed 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 111 KB

Complexes of Directed Trees

✍ Dmitry N. Kozlov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 153 KB

To every directed graph G one can associate a complex 2(G) consisting of directed subforests. This construction, suggested to us by R. Stanley, is especially important in the case of a complete double directed graph G n , where it leads to the study of some interesting representations of the symmetr