On the complexity of computing treelength

We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and asked to determine the complexity of recognizing graphs of a bounded treelength Dourisboure and Gavoille (2007)  [6]. Whil...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 158; no. 7; pp. 820 - 827
Main Author:	Lokshtanov, Daniel
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 06.04.2010
Subjects:	Approximation Chordal sandwich problem Exact exponential algorithm Graph treelength Inapproximability NP-complete Chordal sandwich problem Exact exponential algorithm NP-complete Approximation Graph treelength Inapproximability
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!