Counting independent sets in cocomparability graphs (Q1721932)

From MaRDI portal
Revision as of 05:05, 18 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Counting independent sets in cocomparability graphs
scientific article

    Statements

    title
    Counting independent sets in cocomparability graphs (English)
    0 references
    author
    Martin Dyer
    0 references
    Haiko Müller
    0 references
    publication date
    13 February 2019
    0 references
    zbMATH Keywords
    graph algorithms
    0 references
    cocomparability graph
    0 references
    independent set
    0 references
    counting
    0 references
    linear time algorithm
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C30
    0 references
    05C85
    0 references
    05C69
    0 references
    zbMATH DE Number
    7021528
    0 references
    Wikidata QID
    Q61821452
    0 references
    OpenAlex ID
    W2889013496
    0 references
    arXiv ID
    1808.09853
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1721932&oldid=36470253"
    Powered by MediaWiki