ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS (Q5249000)

From MaRDI portal
scientific article; zbMATH DE number 6432007
Language Label Description Also known as
English
ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS
scientific article; zbMATH DE number 6432007

    Statements

    ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS (English)
    0 references
    29 April 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    polling algorithms
    0 references
    broadcasting
    0 references
    communication complexity
    0 references
    graph algorithms
    0 references
    0 references