Volume 37/38,
1992
- Jean-Claude Bermond:
Foreword.
1
Electronic Edition (link) BibTeX
- James Allwright:
New (Delta, D) Graphs Discovered by Heuristic Search.
3-8
Electronic Edition (link) BibTeX
- Noga Alon:
Transmitting in the n-Dimensional Cube.
9-11
Electronic Edition (link) BibTeX
- Kunwarjit S. Bagga, Lowell W. Beineke, Wayne Goddard, Marc J. Lipman, Raymond E. Pippert:
A Survey of Integrity.
13-28
Electronic Edition (link) BibTeX
- Reuven Bar-Yehuda, Tuvi Etzion:
Connections Between two Cycles - a New Design of Dense Processor Interconnection Networks.
29-43
Electronic Edition (link) BibTeX
- Pietro Camarda, Mario Gerla:
Design and Analysis of Fault-Tolerant Multibus Interconnection Networks.
45-64
Electronic Edition (link) BibTeX
- Lowell Campbell:
Dense Group Networks.
65-71
Electronic Edition (link) BibTeX
- Fan R. K. Chung:
Graphs with Small Diameter After Edge Deletion.
73-94
Electronic Edition (link) BibTeX
- Gene Cooperman, Larry Finkelstein:
New Methods for Using Cayley Graphs in Interconnection Networks.
95-118
Electronic Edition (link) BibTeX
- Sajal K. Das, Joydeep Ghosh, Narsingh Deo:
Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems.
119-146
Electronic Edition (link) BibTeX
- Wenceslas Fernandez de la Vega, Yannis Manoussakis:
The Forwarding Index of Communication Networks with Given Connectivity.
147-155
Electronic Edition (link) BibTeX
- Charles Delorme:
Examples of Products Giving Large Graphs with Given Degree and Diameter.
157-167
Electronic Edition (link) BibTeX
- Ding-Zhu Du, D. Frank Hsu, G. W. Peck:
Connectivity of Consecutive-d Digraphs.
169-177
Electronic Edition (link) BibTeX
- Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak:
Generalized Degrees and Menger Path Systems.
179-191
Electronic Edition (link) BibTeX
- Harold Fredricksen:
A New Look at the de Bruijn Graph.
193-203
Electronic Edition (link) BibTeX
- Arif Ghafoor:
Connectivity, Persistence and Fault Diagnosis of Interconnection Networks Based on Ok and 2Ok Graphs.
205-226
Electronic Edition (link) BibTeX
- José Gómez, Miguel Angel Fiol, J. Luis A. Yebra:
Graphs on Alphabets as Models for Large Interconnection Networks.
227-243
Electronic Edition (link) BibTeX
- Jesse M. Gordon:
Analysis of Minimal Path Routing Schemes in the Presence of Faults.
245-263
Electronic Edition (link) BibTeX
- Niall Graham, Frank Harary:
Changing and Unchanging the Diameter of a Hypercube.
265-274
Electronic Edition (link) BibTeX
- Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
The Connectivity of Hierarchical Cayley Digraphs.
275-280
Electronic Edition (link) BibTeX
- Katherine Heinrich, Kichul Kim, Viktor K. Prasanna:
Perfect Latin Squares.
281-286
Electronic Edition (link) BibTeX
- Marie-Claude Heydemann, J. C. Meyer, Jaroslav Opatrny, Dominique Sotteau:
Forwarding Indices of k-Connected Graphs.
287-296
Electronic Edition (link) BibTeX
- Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau:
Broadcasting and Spanning Trees in de Bruijn and Kautz Networks.
297-317
Electronic Edition (link) BibTeX
- Henk D. L. Hollmann, Jacobus H. van Lint:
Nonblocking Self-Routing Switching Networks.
319-340
Electronic Edition (link) BibTeX
- Xiao-Dong Hu, Frank K. Hwang:
An Improved Upper Bound for the Subarray Partial Concentrators.
341-346
Electronic Edition (link) BibTeX
- Leif K. Jørgensen:
Diameters of Cubic Graphs.
347-351
Electronic Edition (link) BibTeX
- William M. Kantor:
Some Large Trivalent Graphs Having Small Diameters.
353-357
Electronic Edition (link) BibTeX
- Clyde P. Kruskal, Marc Snir:
Cost-Performance Tradeoffs for Interconnection Networks.
359-385
Electronic Edition (link) BibTeX
- Emmanuel Lazard:
Broadcasting in DMA-Bound Bounded Degree Graphs.
387-400
Electronic Edition (link) BibTeX
- Arthur L. Liestman, Joseph G. Peters:
Minimum Broadcast Digraphs.
401-419
Electronic Edition (link) BibTeX
- Ueli M. Maurer:
Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs.
421-436
Electronic Edition (link) BibTeX
- Nicholas Pippenger:
The Asymptotic Optimality of Spider-Web Networks.
437-450
Electronic Edition (link) BibTeX
- Ján Plesník:
Heuristics for the Steiner Problem in Graphs.
451-463
Electronic Edition (link) BibTeX
- Arnold L. Rosenberg:
Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies.
465-488
Electronic Edition (link) BibTeX
- Douglas R. Shier, E. J. Valvo, Robert E. Jamison:
Generating the States of a Binary Stochastic System.
489-500
Electronic Edition (link) BibTeX
- Patrick Solé, Arif Ghafoor, Sohail Sheikh:
The Covering Radius of Hadamard Codes in Odd Graphs.
501-510
Electronic Edition (link) BibTeX
- Terunao Soneoka:
Super Edge-Connectivity of Dense Digraphs and Graphs.
511-523
Electronic Edition (link) BibTeX
- Jorge Luis Villar:
The Underlying Graph of a Line Digraph.
525-538
Electronic Edition (link) BibTeX
- Koichi Wada, Kimio Kawaguchi:
Efficient Fault-Tolerant Fixed Routings on (k + 1)-Connected Digraphs.
539-552
Electronic Edition (link) BibTeX
- Gilles Zémor, Gérard D. Cohen:
Application of Coding Theory to Interconnection Networks.
553-562
Electronic Edition (link) BibTeX
- Guy W. Zimmerman, Abdol-Hossein Esfahanian:
Chordal Rings as Fault-Tolerant Loops.
563-573
Electronic Edition (link) BibTeX
- Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater:
Table of Large (Delta, D)-Graphs.
575-577
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:55:09 2009
by Michael Ley (ley@uni-trier.de)