Explicit construction of linear sized tolerant networks

Discrete Mathematics

Volumn 72, Issue 1-3, 1988, Pages 15-19

  Alon, N ^a   Chung, F R K ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249028223     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(88)90189-6     Document Type: Article

References (19)

1. Eigenvalues and expanders
2. Eigenvalues expanders and superconcentrators
3. 1, isoperimetric inequalities for graphs and superconcentrators
4. On size Ramsey number of paths trees and cycles I
5. Optimal simulation of tree machines
6. A survey of noncomplete Ramsey theory for graphs
7. On universal graphs for spanning trees
8. On sparse graphs with dense long paths
9. The size Ramsey number
10. Expanding graphs contain all small trees
11. A graph model for fault-tolerant computing systems
12. Hamiltonian circuits in random graphs
13. Fault-tolerant interconnection networks, a graph-theoretic approach
14. Minimum k-Hamiltonian graphs