Parallel algorithms for finding Hamilton cycles in random graphs (Q1108039)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4066365
Language Label Description Also known as
default for all languages
No label defined
    English
    Parallel algorithms for finding Hamilton cycles in random graphs
    scientific article; zbMATH DE number 4066365

      Statements

      Parallel algorithms for finding Hamilton cycles in random graphs (English)
      0 references
      1987
      0 references
      Hamilton cycle
      0 references
      parallel algorithm
      0 references
      random graph
      0 references
      dynamic programming
      0 references
      0 references

      Identifiers