Efficient parallel graph algorithms for coarse-grained multicomputers and BSP (Q1601013)

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 1756781
Language Label Description Also known as
default for all languages
No label defined
    English
    Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
    scientific article; zbMATH DE number 1756781

      Statements

      Efficient parallel graph algorithms for coarse-grained multicomputers and BSP (English)
      0 references
      0 references
      17 June 2002
      0 references
      coarse grained parallel computing
      0 references
      graph algorithms
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers