On the complexity of computing treelength (Q972342)

From MaRDI portal
Revision as of 10:36, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of computing treelength
scientific article

    Statements

    title
    On the complexity of computing treelength (English)
    0 references
    author
    Daniel Lokshtanov
    0 references
    publication date
    25 May 2010
    0 references
    zbMATH Keywords
    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

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C05
    0 references
    05C85
    0 references
    68R10
    0 references
    zbMATH DE Number
    5711873
    0 references
    OpenAlex ID
    W1980831620
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q972342&oldid=38558817"
    Powered by MediaWiki