Optimal parallel construction of prescribed tournaments (Q2641314)

From MaRDI portal
Revision as of 19:32, 6 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Optimal parallel construction of prescribed tournaments
scientific article

    Statements

    Optimal parallel construction of prescribed tournaments (English)
    0 references
    0 references
    1990
    0 references
    The author presents an algorithm that constructs a tournament \(T_ n\) having a specified score list in time O(log n) using \(O(n^ 2/\log n)\) processors.
    0 references
    0 references
    construction
    0 references
    tournament
    0 references
    score list
    0 references

    Identifiers