Explicit construction of linear sized tolerant networks. (Reprint)

DOI10.1016/J.DISC.2006.03.025MaRDI QIDQ2498004zbMATH OpenOpenAlexFDO

Authors Noga Alon, Fan Chung

Publication date 4 August 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.03.025

Mathematics Subject Classification ID

Paths and cycles (05C38) Generalized Ramsey theory (05C55) Graph theory (05C99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Explicit construction of linear sized tolerant networks
• On Minimum Fault-Tolerant Networks
• Computing and Combinatorics
• Efficient fault-tolerant routings in networks
• On fault tolerant routings in general networks

Cites work

• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• A Graph Model for Fault-Tolerant Computing Systems
• Eigenvalues and expanders
• Expanding graphs contain all small trees
• Hamiltonian circuits in random graphs
• scientific article; zbMATH DE number 3843670 (Why is no real title available?)
• scientific article; zbMATH DE number 3708485 (Why is no real title available?)
• scientific article; zbMATH DE number 3711961 (Why is no real title available?)
• scientific article; zbMATH DE number 3754747 (Why is no real title available?)
• MinimumK-hamiltonian graphs
• On size Ramsey number of paths, trees, and circuits. I
• On sparse graphs with dense long paths
• On Universal Graphs for Spanning Trees
• Ramanujan graphs
• Size Ramsey numbers involving stars
• The size Ramsey number

Cited in

(5)

• Explicit construction of linear sized tolerant networks
• Ordered size Ramsey number of paths
• On Minimum Fault-Tolerant Networks
• Satisfiable Tseitin formulas are hard for nondeterministic read-once branching programs
• ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES

This page was built for publication: Explicit construction of linear sized tolerant networks. (Reprint)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2498004)