Complexity of representation of graphs by set systems (Q1158768)

From MaRDI portal
Revision as of 08:32, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of representation of graphs by set systems
scientific article

    Statements

    title
    Complexity of representation of graphs by set systems (English)
    0 references
    author
    Svatopluk Poljak
    0 references
    Vojtěch Rödl
    0 references
    Daniel Turzík
    0 references
    publication date
    1981
    0 references
    zbMATH Keywords
    NP-complete
    0 references
    random graphs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    05C99
    0 references
    zbMATH DE Number
    3742646
    0 references
    OpenAlex ID
    W1965922177
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1158768&oldid=36899993"
    Powered by MediaWiki