Symmetric flows and broadcasting in hypercubes
DOI10.5802/aif.1692zbMath0928.68133OpenAlexW4361867932MaRDI QIDQ1296143
Stéphane Pérennes, Jean-Claude Bermond, Patrick Solé, T. Kodate, Alexis Bonnecaze
Publication date: 12 July 1999
Published in: Annales de l'Institut Fourier (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=AIF_1999__49_3_787_0
hypercubeconnectivityerror correcting codesbroadcasting(symmetric) flow networkscircuit switched model
Communication networks in operations research (90B18) Linear codes (general theory) (94B05) Deterministic network models in operations research (90B10) Parallel algorithms in computer science (68W10) Connectivity (05C40)
Related Items (1)
Cites Work
- Quelques problèmes de connexite dans les graphes orientes
- Connectivity of minimal Cayley graphs
- Methods and problems of communication in usual networks
- On the connectivity of Cayley digraphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- A survey of gossiping and broadcasting in communication networks
- A new approach to the maximum-flow problem
- Connectivity of transitive graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Symmetric flows and broadcasting in hypercubes