On the complexity of computing treelength (Q972342): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2009.10.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980831620 / rank | |||
Normal rank | |||
Revision as of 19:05, 19 March 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
