TY  - JOUR
AB  - Motivated by a certain model of parallel computing in unreliable networks we study combinatorial problems of the following type: For any graph and any integer c, what is the least number d such that removal of any d edges (or vertices) leaves a graph with a largest connected component of more than c vertices. We give rather precise estimates for the n-cube.
DA  - 1983
DO  - 10.1016/0012-365X(83)90084-5
LA  - eng
M2  - 137
PY  - 1983
SN  - 0012-365X
SP  - 137-152
T2  - Discrete Mathematics
TI  - Note on an extremal problem arising for unreliable networks in parallel computing
UR  - https://nbn-resolving.org/urn:nbn:de:0070-pub-17751003
Y2  - 2024-11-22T06:31:40
ER  -