Parallel algorithms for geometric graph problems (Q5259593)

From MaRDI portal
Revision as of 09:44, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6451587
Language Label Description Also known as
English
Parallel algorithms for geometric graph problems
scientific article; zbMATH DE number 6451587

    Statements

    title
    Parallel algorithms for geometric graph problems (English)
    0 references
    author
    Alexandr Andoni
    0 references
    Aleksandar Nikolov
    0 references
    Krzysztof Onak
    0 references
    Grigory Yaroslavtsev
    0 references
    publication date
    26 June 2015
    0 references
    zbMATH Keywords
    MapReduce
    0 references
    earth-mover distance
    0 references
    minimum spanning tree
    0 references
    parallel computation
    0 references
    cites work
    Q5302085
    0 references
    Theory of Cryptography
    0 references
    Q3549600
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C10
    0 references
    68U05
    0 references
    68W10
    0 references
    68W25
    0 references
    zbMATH DE Number
    6451587
    0 references
    OpenAlex ID
    W2057082426
    0 references
    arXiv ID
    1401.0042
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5259593&oldid=36081342"
    Powered by MediaWiki