Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs (Q3557058)

From MaRDI portal
Revision as of 01:38, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs
scientific article

    Statements

    title
    Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs (English)
    0 references
    author
    Andrzej Ruciński
    0 references
    Edyta Szymańska
    0 references
    Marek Karpinski
    0 references
    publication date
    27 April 2010
    0 references
    Mathematics Subject Classification ID
    05C45
    0 references
    05C65
    0 references
    05C85
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    5702190
    0 references
    OpenAlex ID
    W1558898895
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3557058&oldid=32627710"
    Powered by MediaWiki