Journals in DBLP
Jean-Claude Bermond Foreword. [Citation Graph (0, 0)][DBLP ] Journal ] James Allwright New (Delta, D ) Graphs Discovered by Heuristic Search. [Citation Graph (0, 0)][DBLP ] Journal ] Noga Alon Transmitting in the n -Dimensional Cube. [Citation Graph (0, 0)][DBLP ] Journal ] Kunwarjit S. Bagga , Lowell W. Beineke , Wayne Goddard , Marc J. Lipman , Raymond E. Pippert A Survey of Integrity. [Citation Graph (0, 0)][DBLP ] Journal ] Reuven Bar-Yehuda , Tuvi Etzion Connections Between two Cycles - a New Design of Dense Processor Interconnection Networks. [Citation Graph (0, 0)][DBLP ] Journal ] Pietro Camarda , Mario Gerla Design and Analysis of Fault-Tolerant Multibus Interconnection Networks. [Citation Graph (0, 0)][DBLP ] Journal ] Lowell Campbell Dense Group Networks. [Citation Graph (0, 0)][DBLP ] Journal ] Fan R. K. Chung Graphs with Small Diameter After Edge Deletion. [Citation Graph (0, 0)][DBLP ] Journal ] Gene Cooperman , Larry Finkelstein New Methods for Using Cayley Graphs in Interconnection Networks. [Citation Graph (0, 0)][DBLP ] Journal ] Sajal K. Das , Joydeep Ghosh , Narsingh Deo Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems. [Citation Graph (0, 0)][DBLP ] Journal ] Wenceslas Fernandez de la Vega , Yannis Manoussakis The Forwarding Index of Communication Networks with Given Connectivity. [Citation Graph (0, 0)][DBLP ] Journal ] Charles Delorme Examples of Products Giving Large Graphs with Given Degree and Diameter. [Citation Graph (0, 0)][DBLP ] Journal ] Ding-Zhu Du , D. Frank Hsu , G. W. Peck Connectivity of Consecutive-d Digraphs. [Citation Graph (0, 0)][DBLP ] Journal ] Ralph J. Faudree , Ronald J. Gould , Linda M. Lesniak Generalized Degrees and Menger Path Systems. [Citation Graph (0, 0)][DBLP ] Journal ] Harold Fredricksen A New Look at the de Bruijn Graph. [Citation Graph (0, 0)][DBLP ] Journal ] Arif Ghafoor Connectivity, Persistence and Fault Diagnosis of Interconnection Networks Based on Ok and 2Ok Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] José Gómez , Miguel Angel Fiol , J. Luis A. Yebra Graphs on Alphabets as Models for Large Interconnection Networks. [Citation Graph (0, 0)][DBLP ] Journal ] Jesse M. Gordon Analysis of Minimal Path Routing Schemes in the Presence of Faults. [Citation Graph (0, 0)][DBLP ] Journal ] Niall Graham , Frank Harary Changing and Unchanging the Diameter of a Hypercube. [Citation Graph (0, 0)][DBLP ] Journal ] Yahya Ould Hamidoune , Anna S. Lladó , Oriol Serra The Connectivity of Hierarchical Cayley Digraphs. [Citation Graph (0, 0)][DBLP ] Journal ] Katherine Heinrich , Kichul Kim , Viktor K. Prasanna Perfect Latin Squares. [Citation Graph (0, 0)][DBLP ] Journal ] Marie-Claude Heydemann , J. C. Meyer , Jaroslav Opatrny , Dominique Sotteau Forwarding Indices of k -Connected Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Marie-Claude Heydemann , Jaroslav Opatrny , Dominique Sotteau Broadcasting and Spanning Trees in de Bruijn and Kautz Networks. [Citation Graph (0, 0)][DBLP ] Journal ] Henk D. L. Hollmann , Jacobus H. van Lint Nonblocking Self-Routing Switching Networks. [Citation Graph (0, 0)][DBLP ] Journal ] Xiao-Dong Hu , Frank K. Hwang An Improved Upper Bound for the Subarray Partial Concentrators. [Citation Graph (0, 0)][DBLP ] Journal ] Leif K. Jørgensen Diameters of Cubic Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] William M. Kantor Some Large Trivalent Graphs Having Small Diameters. [Citation Graph (0, 0)][DBLP ] Journal ] Clyde P. Kruskal , Marc Snir Cost-Performance Tradeoffs for Interconnection Networks. [Citation Graph (0, 0)][DBLP ] Journal ] Emmanuel Lazard Broadcasting in DMA-Bound Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Arthur L. Liestman , Joseph G. Peters Minimum Broadcast Digraphs. [Citation Graph (0, 0)][DBLP ] Journal ] Ueli M. Maurer Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Nicholas Pippenger The Asymptotic Optimality of Spider-Web Networks. [Citation Graph (0, 0)][DBLP ] Journal ] Ján Plesník Heuristics for the Steiner Problem in Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Arnold L. Rosenberg Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies. [Citation Graph (0, 0)][DBLP ] Journal ] Douglas R. Shier , E. J. Valvo , Robert E. Jamison Generating the States of a Binary Stochastic System. [Citation Graph (0, 0)][DBLP ] Journal ] Patrick Solé , Arif Ghafoor , Sohail Sheikh The Covering Radius of Hadamard Codes in Odd Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Terunao Soneoka Super Edge-Connectivity of Dense Digraphs and Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Jorge Luis Villar The Underlying Graph of a Line Digraph. [Citation Graph (0, 0)][DBLP ] Journal ] Koichi Wada , Kimio Kawaguchi Efficient Fault-Tolerant Fixed Routings on (k + 1)-Connected Digraphs. [Citation Graph (0, 0)][DBLP ] Journal ] Gilles Zémor , Gérard D. Cohen Application of Coding Theory to Interconnection Networks. [Citation Graph (0, 0)][DBLP ] Journal ] Guy W. Zimmerman , Abdol-Hossein Esfahanian Chordal Rings as Fault-Tolerant Loops. [Citation Graph (0, 0)][DBLP ] Journal ] Jean-Claude Bermond , Charles Delorme , Jean-Jacques Quisquater Table of Large (Delta, D )-Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] 