scientific article; zbMATH DE number 1982177

zbMath1023.68645MaRDI QIDQ4426346

Aziz Moukrim, Jacques Carlier, François Clautiaux, 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

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (15)

Constructing Brambles ⋮ Achievable sets, brambles, and sparse treewidth obstructions ⋮ Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth ⋮ Treewidth lower bounds with brambles ⋮ Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization ⋮ A branch-and-price-and-cut method for computing an optimal bramble ⋮ Tree decomposition and discrete optimization problems: a survey ⋮ Treewidth computations. I: Upper bounds ⋮ A cubic kernel for feedback vertex set and loop cutset ⋮ Treewidth computations. II. Lower bounds ⋮ On the maximum cardinality search lower bound for treewidth ⋮ Encoding Treewidth into SAT ⋮ An Experimental Study of the Treewidth of Real-World Graph Data ⋮ Heuristic and metaheuristic methods for computing graph treewidth ⋮ Computing treewidth on the GPU

This page was built for publication: