Portal de Periódicos da CAPES

Strategies for interconnection networks: Some methods from graph theory

1986; Elsevier BV; Volume: 3; Issue: 4 Linguagem: Inglês

10.1016/0743-7315(86)90008-0

1096-0848

J.-C. Bermond, Charles Delorme, J.-J. Quisquater,

VLSI and FPGA Design Techniques

Interconnection networks require dense graphs in the sense that many nodes with relatively few links may be connected with relatively short paths. Some recent constructions of such dense graphs with a given maximal degree Δ and diameter D (known as (Δ, D) graphs) are reviewed here. The paper also contains an updated table of the best known (Δ, D) graphs.