Note on an extremal problem arising for unreliable networks in parallel computing

DOI10.1016/0012-365X(83)90084-5zbMath0528.05039MaRDI QIDQ786823

Klaus-Uwe Koschnick

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

parallel computing systemsn-cubemaximal connected componentreliable interconnection networks

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items (3)

Hypercube sandwich approach to conferencing. ⋮ On diagnosability of large multiprocessor networks ⋮ Interactive Communication, Diagnosis and Error Control in Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contributions to the geometry of Hamming spaces
• On the strength of connectedness of a random graph
• Bounds on conditional probabilities with applications in multi-user communication
• Graphs with maximal number of adjacent pairs of edges
• Assignment of Numbers to Vertices
• A new solution of Dijkstra's concurrent programming problem
• Maximally Connected Arrays on the n-Cube
• Optimal numberings and isoperimetric problems on graphs
• Configurations Maximizing the Number of Pairs of Hamming‐Adjacent Lattice Points
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
• Combinatorial Algebra and Random Graphs
• Die Brunn‐Minkowskische Ungleichung und ihr Spiegelbild sowie die isoperimetrische Eigenschaft der Kugel in der euklidischen und nichteuklidischen Geometrie. II

This page was built for publication: Note on an extremal problem arising for unreliable networks in parallel computing