Directed Tree-Width

2001/05/01 by Thor Johnson, Neil Robertson, Paul Seymour +2 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Bounded function #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Digraph #Directed graph #Discrete mathematics #Graph #Interconnection Networks and Systems #Mathematics #Tree (set theory)

paper · doi:10.1006/jctb.2000.2031

crossref issued 2001/05/01 · crossref published 2001/05/01 · crossref published-print 2001/05/01 · openalex publication_date 2001/05/01 · crossref created 2002/09/18 · crossref deposited 2019/05/08 · openalex created_date 2025/10/10 · crossref indexed 2026/07/07 · openalex updated_date 2026/07/23

Citations

• Linear time algorithms for NP-hard problems restricted to partial k-trees
• Graph minors. III. Planar tree-width
• S-functions for graphs
• Graph Searching and a Min-Max Theorem for Tree-Width
• Searching and pebbling
• Interval graphs and seatching
• Graph minors. V. Excluding a planar graph
• Quickly excluding a forest
• Complexity of Finding Embeddings in a k-Tree

Cited by

• Haven (graph theory) [wikipedia]