Publication:4426346
From MaRDI portal
zbMath1023.68645MaRDI QIDQ4426346
Aziz Moukrim, François Clautiaux, Jacques Carlier, Stéphane Negre
Publication date: 16 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2647/26470070.htm
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Heuristic and metaheuristic methods for computing graph treewidth, Treewidth computations. II. Lower bounds, Achievable sets, brambles, and sparse treewidth obstructions, Treewidth lower bounds with brambles, Treewidth computations. I: Upper bounds, A cubic kernel for feedback vertex set and loop cutset, On the maximum cardinality search lower bound for treewidth, Tree decomposition and discrete optimization problems: a survey, Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization, Constructing Brambles, Encoding Treewidth into SAT