On the complexity of computing treelength (Q972342): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:34, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of computing treelength |
scientific article |
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
