scientific article; zbMATH DE number 1301101
From MaRDI portal
Publication:4246749
zbMATH Open0925.05052MaRDI QIDQ4246749FDOQ4246749
Authors: Ton Kloks, Hans L. Bodlaender 
Publication date: 15 June 1999
Title of this publication is not available (Why is that?)
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (10)
- Treewidth governs the complexity of target set selection
- On tradeoffs between width- and fill-like graph parameters
- Satisfiability of acyclic and almost acyclic CNF formulas
- Satisfiability of acyclic and almost acyclic CNF formulas. II
- New deterministic algorithms for solving parity games
- Linear rank-width and linear clique-width of trees
- The complexity of subgraph isomorphism for classes of partial k-trees
- A backward selection procedure for approximating a discrete probability distribution by decomposable models
- Treewidth of cocomparability graphs and a new order-theoretic parameter
- 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)
