2005/01/01 by Joachim Kneis, Daniel Mölle, Stefan Richter +1 · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Graph #Interconnection Networks and Systems #Line graph #Mathematics #Partial k-tree #Pathwidth #Simple (philosophy) #Time complexity #Tree decomposition #Treewidth #Upper and lower bounds
paper · doi:10.1007/11604686_34
crossref issued 2005/01/01 · crossref published 2005/01/01 · crossref published-print 2005/01/01 · openalex publication_date 2005/01/01 · crossref created 2005/12/05 · crossref deposited 2021/04/27 · crossref indexed 2024/09/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29