2008/04/01 by Eyal Amir · 1 citation
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Algorithm #Approximation algorithm #Chordal graph #Clique-sum #Clique-width #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Exponential function #Graph #Interconnection Networks and Systems #Line graph #Mathematics #Partial k-tree #Pathwidth #Theory of computation #Time complexity #Tree decomposition #Tree-depth #Treewidth #Voltage graph
paper · doi:10.1007/s00453-008-9180-4
openalex publication_date 2008/04/01 · crossref created 2008/04/01 · crossref issued 2008/04/02 · crossref published 2008/04/02 · crossref published-online 2008/04/02 · crossref published-print 2010/04/01 · crossref deposited 2019/05/29 · openalex created_date 2025/10/10 · crossref indexed 2026/05/06 · openalex updated_date 2026/07/29