Determining treelength is hard Daniel

Abstract

In this article we resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourusboure and Gavoille, who introduced this parameter, and asked to determine the complexity of recognizing graphs of bounded treelength [7]. The treelength of a graph G deals with the length of a tree-decomposition. The… (More)

Topics

Cite this paper

@inproceedings{Lokshtanov2006DeterminingTI, title={Determining treelength is hard Daniel}, author={Daniel Lokshtanov}, year={2006} }