Save up to 30% on Elsevier print and eBooks with free shipping. No promo code needed.
Save up to 30% on print and eBooks.
Interconnection Networks
1st Edition, Volume 5 - August 21, 1992
Editor: J.-C. Bermond
Language: English
eBook ISBN:9781483295275
9 7 8 - 1 - 4 8 3 2 - 9 5 2 7 - 5
Most of the articles in this book deal with static or point-to-pointInterconnection Networks. In particular, new constructions are proposed basedon different tools from discrete…Read more
Purchase options
LIMITED OFFER
Save 50% on book bundles
Immediately download your ebook while waiting for your print delivery. No promo code is needed.
Most of the articles in this book deal with static or point-to-pointInterconnection Networks. In particular, new constructions are proposed basedon different tools from discrete mathematics. Many new records have beenestablished in the table of the maximum number of vertices of graphs withmaximum degree &Dgr; and diameter D. Properties of thesenetworks (and of more classical ones) are analyzed in many of the otherpapers. About 40% of the articles deal with fault tolerance orvulnerability properties using either combinatorial tools or probabilisticones.
New (&Dgr;D) Graphs Discovered by Heuristic Search. Transmitting in the n-Dimensional Cube. A Survey of Integrity. Connections between Two Cycles - A New Design of Dense Processor Interconnection Networks (INs). Design and Analysis of Fault-Tolerant Multibus INs. Dense Group Networks. Graphs with Small Diameter After Edge Deletion. New Methods for Using Cayley Graphs in INs. Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems. The Forwarding Index of Communication Networks with Given Connectivity. Examples of Products Giving Large Graphs with Given Degree and Diameter. Connectivity of Consecutive-d Digraphs. Generalized Degrees and Menger Path Systems. A New Look at the de Bruijn Graph. Connectivity, Persistence and Fault Diagnosis of INs based on Ok and 2Ok Graphs. Graphs on Alphabets as Models for Large INs. Analysis of Minimal Path Routing Schemes in the Presence of Faults. Changing and Unchanging the Diameter of a Hypercube. The Connectivity of Hierarchical Cayley Digraphs. Perfect Latin Squares. Forwarding Indices of k-Connected Graphs. Broadcasting and Spanning trees in the de Bruijn and Kautz Networks. Nonblocking Self-Routing Switching networks. An Improved Upper Bound for the Subarray Partial Concentrators. Diameters of Cubic Graphs. Some Large Trivalent Graphs having Small Diameters. Cost-Performance Tradeoffs for INs. Broadcasting in DMA-Bound Bounded Degree Graphs. Minimum Broadcast Digraphs. Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs. The Asymptotic Optimality of Spider-Web Networks. Heuristics for the Steiner Problem in Graphs. Product Shuffle-Networks: Towards Reconciling Shuffles and Butterflies. Generating the States of a Binary Stochastic System. The Covering Radius of Hadamard Codes in Odd Graphs. Super Edge-Connectivity of Dense Digraphs and Graphs. The Underlying Graphs of a Line Digraph. Efficient Fault-Tolerant Fixed Routing on (k+1)-Connected Digraphs. Application of Coding Theory to INs. Chordal Rings as Fault-Tolerant Loops. Tables of Large ( ,D)-Graphs. Author Index.
Language: English
Edition: 1
Volume: 5
Published: August 21, 1992
Imprint: North Holland
eBook ISBN: 9781483295275
JB
J.-C. Bermond
Affiliations and expertise
i3S, CNRS, URA 1376, bat 4, rue A. Einstein, Sophia-Antipolis, F-06560 Valbonne, France