A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477)

From MaRDI portal
Revision as of 01:57, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
scientific article

    Statements

    title
    A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (English)
    0 references
    publication date
    17 June 2009
    0 references
    zbMATH Keywords
    Hamiltonian cycle
    0 references
    parallel algorithm
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C45
    0 references
    05C07
    0 references
    68R10
    0 references
    68W10
    0 references
    zbMATH DE Number
    5565699
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1024477&oldid=25941826"
    Powered by MediaWiki