Bus interconnection networks
type: Item
instance of: scholarly article
title: Bus interconnection networks
zbMATH Open document ID: 0852.05066
DOI: 10.1016/0166-218X(95)00046-T
author: Fahir Ö. Ergincan
author: Jean-Claude Bermond
published in: Discrete Applied Mathematics
publication date: 1996-11-25T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 94C15
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 897430
zbMATH Keywords: bus interconnection networks
zbMATH Keywords: processors
zbMATH Keywords: hypergraphs
zbMATH Keywords: network diameter
zbMATH Keywords: point-to-point networks
zbMATH Keywords: bus networks
MaRDI profile type: Publication
cites work: The nonexistence of rank three permutation groups of degree 3250 and subdegree 57
cites work: Q4099676
cites work: Q4000490
cites work: Q4294575
cites work: Q3039368
cites work: Q3780901
cites work: Q3347920
cites work: Q3786500
cites work: De Bruijn and Kautz bus networks
cites work: Table of large \(({\Delta{}}, D)\)-graphs
cites work: Generalized Hypercube and Hyperbus Structures for a Computer Network
cites work: Q3794213
cites work: A generalization of Moore graphs of diameter two
cites work: Q3992965
cites work: Q3320418
cites work: Q3727877
cites work: The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
cites work: On Moore geometries. II
cites work: On Moore Geometries, I
cites work: Large Graphs with Given Degree and Diameter—Part I
cites work: Directed Moore hypergraphs
cites work: GOSSIPING IN BUS INTERCONNECTION NETWORKS
cites work: Processor Interconnection Strategies
cites work: Dense bipartite digraphs
cites work: On finite Moore geometries
cites work: The nonexistence of Moore geometries of diameter 4
cites work: Maximum degree and fractional matchings in uniform hypergraphs
cites work: On Moore Graphs with Diameters 2 and 3
cites work: Q4040932
cites work: MOORE GEOMETRIES AND RANK 3 GROUPS HAVING μ=1
cites work: Q5589121
cites work: Parallel computations on reconfigurable meshes
cites work: Large regular graphs with no induced \(2K_ 2\)
cites work: Fault-Tolerant Multiprocessor Link and Bus Network Architectures
cites work: The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
full work available at URL: 0166-218x(95)00046-t
OpenAlex ID: W2064429892
description: scientific article; zbMATH DE number 897430