Note on an extremal problem arising for unreliable networks in parallel computing
type: Item
instance of: scholarly article
title: Note on an extremal problem arising for unreliable networks in parallel computing
zbMATH Open document ID: 0528.05039
DOI: 10.1016/0012-365X(83)90084-5
author: Klaus-Uwe Koschnick
author: Rudolf Ahlswede
published in: Discrete Mathematics
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 94C15
zbMATH DE Number: 3838062
zbMATH Keywords: n-cube
zbMATH Keywords: maximal connected component
zbMATH Keywords: reliable interconnection networks
zbMATH Keywords: parallel computing systems
MaRDI profile type: Publication
cites work: A new solution of Dijkstra's concurrent programming problem
cites work: Optimal numberings and isoperimetric problems on graphs
cites work: Graphs with maximal number of adjacent pairs of edges
cites work: On the strength of connectedness of a random graph
cites work: Q5546438
cites work: Combinatorial Algebra and Random Graphs
cites work: On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
cites work: Q4086956
cites work: Q4101857
cites work: Q4083487
cites work: Die Brunn‐Minkowskische Ungleichung und ihr Spiegelbild sowie die isoperimetrische Eigenschaft der Kugel in der euklidischen und nichteuklidischen Geometrie. II
cites work: Bounds on conditional probabilities with applications in multi-user communication
cites work: Q4749745
cites work: Assignment of Numbers to Vertices
cites work: Maximally Connected Arrays on the n-Cube
cites work: Configurations Maximizing the Number of Pairs of Hamming‐Adjacent Lattice Points
cites work: Contributions to the geometry of Hamming spaces
cites work: Q4153390
description: scientific article; zbMATH DE number 3838062