On the complexity of computing treelength (Q972342): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2009.10.007 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2009.10.007 / rank | |||
Normal rank | |||
Latest revision as of 10:36, 10 December 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
