scientific article; zbMATH DE number 1471732
From MaRDI portal
Publication:4488861
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(200005)35:3<207::AID-NET4>3.0.CO;2-F" /><207::AID-NET4>3.0.CO;2-F 10.1002/(SICI)1097-0037(200005)35:3<207::AID-NET4>3.0.CO;2-FzbMath0967.68011MaRDI QIDQ4488861
Publication date: 9 July 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)
Related Items (3)
Data center interconnection networks are not hyperbolic ⋮ On the \(k\)-tuple domination of de Bruijn and Kautz digraphs ⋮ Fault-tolerant routing in burnt pancake graphs
Cites Work
- Fault-Tolerant Routing in DeBruijn Comrnunication Networks
- Generalized de Bruijn digraphs
- The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
- A Fault-Tolerant Communication Architecture for Distributed Systems
- Linear spans of modified de Bruijn sequences
- The undirected de Bruijn graph: fault tolerance and routing algorithms
- Broadcasting and Gossiping in de Bruijn Networks
- Fault Tolerance on Star Graphs
This page was built for publication: