On the complexity of computing treelength (Q972342)

From MaRDI portal
Revision as of 19:05, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references