scientific article; zbMATH DE number 1301101

MaRDI QIDQ4246749zbMATH OpenFDO

Authors Ton Kloks, Hans L. Bodlaender

Publication date 15 June 1999

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(9)

• Treewidth governs the complexity of target set selection
• Satisfiability of acyclic and almost acyclic CNF formulas
• On tradeoffs between width- and fill-like graph parameters
• Satisfiability of acyclic and almost acyclic CNF formulas. II
• Linear rank-width and linear clique-width of trees
• The complexity of subgraph isomorphism for classes of partial k-trees
• Treewidth of cocomparability graphs and a new order-theoretic parameter
• A backward selection procedure for approximating a discrete probability distribution by decomposable models
• Treewidth and pathwidth of permutation graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4246749)