On the complexity of computing treelength (Q972342)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of computing treelength |
scientific article; zbMATH DE number 5711873
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of computing treelength |
scientific article; zbMATH DE number 5711873 |
Statements
On the complexity of computing treelength (English)
0 references
25 May 2010
0 references
graph tree-length
0 references
NP-completeness
0 references
approximation
0 references
inapproximability
0 references
exact exponential algorithm
0 references
chordal sandwich problem
0 references
0.9999998
0 references
0.9465803
0 references
0.9465803
0 references
0.93278676
0 references
0.92416173
0 references
0.92101824
0 references
0.92026496
0 references
0.91810054
0 references
0 references
