Computing tree width: from theory to practice and back

DOI10.1007/978-3-319-94418-0_8OpenAlexW2811185010MaRDI QIDQ1670723

Sebastian Berndt

Publication date: 6 September 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94418-0_8

zbMATH Keywords

algorithmstree widthparameterized complexitygraph searchingexperimental evaluation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

Unnamed Item ⋮ Treewidth of display graphs: bounds, brambles and applications

This page was built for publication: Computing tree width: from theory to practice and back