✦ LIBER ✦

Introducing Directed Tree Width

✍ Scribed by B. Reed

Book ID: 108498097
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 111 KB
Volume: 3
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80061-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Tree-width, path-width, and cutwidth

✍ Ephraim Korach; Nir Solel 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 387 KB

An Extended Tree-Width Notion for Direct

An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents

✍ Klaus Meer 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 567 KB

Width Parameters Beyond Tree-width and t

Width Parameters Beyond Tree-width and their Applications

✍ Hlineny, P.; Oum, S.-i.; Seese, D.; Gottlob, G. 📂 Article 📅 2007 🏛 Oxford University Press 🌐 English ⚖ 634 KB

Bounded Tree-Width and LOGCFL

✍ E. Wanke 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 902 KB

We show that (1) the recognition of tree-width bounded graphs and (2) the decidability of graph properties--which are defined by finite equivalence relations on \(h\)-sourced graphs-on tree-width bounded graphs belong to the complexity class LOGCFL. This is the lowest complexity class known for thes

The dag-width of directed graphs

✍ Dietmar Berwanger; Anuj Dawar; Paul Hunter; Stephan Kreutzer; Jan Obdržálek 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 346 KB