Publication:4246749
From MaRDI portal
zbMath0925.05052MaRDI QIDQ4246749
Publication date: 15 June 1999
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Treewidth governs the complexity of target set selection, The complexity of subgraph isomorphism for classes of partial k-trees, Treewidth of cocomparability graphs and a new order-theoretic parameter, Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)