Sparsity-certifying graph decompositions (Q1043807)

From MaRDI portal
Revision as of 10:48, 4 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56651071, #quickstatements; #temporary_batch_1709545057628)
scientific article
Language Label Description Also known as
English
Sparsity-certifying graph decompositions
scientific article

    Statements

    title
    Sparsity-certifying graph decompositions (English)
    0 references
    author
    Ileana Streinu
    0 references
    Louis Theran
    0 references
    publication date
    9 December 2009
    0 references
    zbMATH Keywords
    sparse graph algorithm
    0 references
    tree decompositions
    0 references
    matroids
    0 references
    pebble game algorithm
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C70
    0 references
    05C05
    0 references
    05B35
    0 references
    05C85
    0 references
    zbMATH DE Number
    5644638
    0 references
    Wikidata QID
    Q56651071
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1043807&oldid=24487425"
    Powered by MediaWiki