Fault-Tolerant Graphs for Tori

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Toshinori Yamada Articles by Shuichi Ueno

1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96)

Beijing, CHINA

June 12-June 14

ISBN: 0-8186-7460-1

	ASCII Text	x
	Toshinori Yamada, Shuichi Ueno, "Fault-Tolerant Graphs for Tori," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 408, 1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96), 1996.

	BibTex	x
	@article{ 10.1109/ISPAN.1996.509018, author = {Toshinori Yamada and Shuichi Ueno}, title = {Fault-Tolerant Graphs for Tori}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {1996}, issn = {1087-4089}, pages = {408}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.1996.509018}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - Fault-Tolerant Graphs for Tori SN - 1087-4089 SP EP A1 - Toshinori Yamada, A1 - Shuichi Ueno, PY - 1996 KW - Tori KW - Matric Graphs KW - Edge-Fault-Tolerant Graphs KW - Dimension-Fault-Tolerant Graphs KW - Error-Correcting Linear Codes VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER -

Toshinori Yamada, Tokyo Institute of Technology

Shuichi Ueno, Tokyo Institute of Technology

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.1996.509018

Motivated by the design of fault-tolerant multiprocessor interconnection networks, this paper considers the following problem: Given a positive integer t and a graph H, construct a graph G from H by adding a minimum number A(t,H) of edges such that even after deleting any t edges from G the remaining graph contains H as a subgraph. We estimate A(t,H) for the torus, which is well-known as a very important interconnection network for multiprocessor systems.

Index Terms:

Tori, Matric Graphs, Edge-Fault-Tolerant Graphs, Dimension-Fault-Tolerant Graphs, Error-Correcting Linear Codes

Citation:

Toshinori Yamada, Shuichi Ueno, "Fault-Tolerant Graphs for Tori," ispan, pp.408, 1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96), 1996

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.