RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 1990 Volume 26, Issue 2, Pages 87–97 (Mi ppi609)
Communication-Network Theory and Large System Science

A Simple Stable RMA Algorithm for LAN

V. P. Polesskii


Abstract: Effective and exact upper bounds are proved on the probability of connectedness of a distinguished group of vertices in a random graph. These results generalize previous bounds on the probability of connectedness of all vertices in a graph.

UDC: 621.394.74

Received: 15.06.1987
Revised: 01.03.1989


 English version: Problems of Information Transmission, 1990, 26:2, 161–169

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024