IEICE TRANSACTIONS on Fundamentals
Nonadaptive Fault-Tolerant File Transmission in Rotator Graphs
Summary :
A directed graph G = (V,E) is called the n-rotator graph if V = {a1a2・・・an|a1a2・・・an is a permutation of 1,2,・・・,n} and E = {(a1a2・・・an,b1b2・・・bn)| for some 2
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E79-A No.4 pp.477-482
- Publication Date
- 1996/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yukihiro HAMADA, Feng BAO, Aohan MEI, Yoshihide IGARASHI, "Nonadaptive Fault-Tolerant File Transmission in Rotator Graphs" in IEICE TRANSACTIONS on Fundamentals,
vol. E79-A, no. 4, pp. 477-482, April 1996, doi: .
Abstract: A directed graph G = (V,E) is called the n-rotator graph if V = {a1a2・・・an|a1a2・・・an is a permutation of 1,2,・・・,n} and E = {(a1a2・・・an,b1b2・・・bn)| for some 2
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e79-a_4_477/_p
Copy
@ARTICLE{e79-a_4_477,
author={Yukihiro HAMADA, Feng BAO, Aohan MEI, Yoshihide IGARASHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Nonadaptive Fault-Tolerant File Transmission in Rotator Graphs},
year={1996},
volume={E79-A},
number={4},
pages={477-482},
abstract={A directed graph G = (V,E) is called the n-rotator graph if V = {a1a2・・・an|a1a2・・・an is a permutation of 1,2,・・・,n} and E = {(a1a2・・・an,b1b2・・・bn)| for some 2
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Nonadaptive Fault-Tolerant File Transmission in Rotator Graphs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 477
EP - 482
AU - Yukihiro HAMADA
AU - Feng BAO
AU - Aohan MEI
AU - Yoshihide IGARASHI
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E79-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 1996
AB - A directed graph G = (V,E) is called the n-rotator graph if V = {a1a2・・・an|a1a2・・・an is a permutation of 1,2,・・・,n} and E = {(a1a2・・・an,b1b2・・・bn)| for some 2
ER -
English
