scientific article; zbMATH DE number 1301101

zbMath0925.05052MaRDI QIDQ4246749

Ton Kloks, Hans L. Bodlaender

Publication date: 15 June 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items

Treewidth of cocomparability graphs and a new order-theoretic parameter, Satisfiability of acyclic and almost acyclic CNF formulas, Treewidth governs the complexity of target set selection, Treewidth and pathwidth of permutation graphs, The complexity of subgraph isomorphism for classes of partial k-trees, Satisfiability of Acyclic and almost Acyclic CNF Formulas (II), New deterministic algorithms for solving parity games, On tradeoffs between width- and fill-like graph parameters, Linear rank-width and linear clique-width of trees, Unnamed Item