Fault-tolerant fixed routing in hypercube generalizations

MaRDI QIDQ699637zbMATH OpenFDO

Authors Anneli Lankinen, J. Nieminen, Matti Peltola, Pasi Ruotsalainen

Publication date 20 January 2003

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

fault-tolerancecommunication graphssurviving graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Recommendations

• Efficient fault-tolerant routings in networks
• New results in graph routing
• Routing in hypercube networks with a constant fraction of faulty nodes
• On fault-tolerant fixed routing in hypercubes
• A new look at fault-tolerant network routing

Cited in

(5)

• Fault-Tolerant Compact Routing Schemes for General Graphs
• A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
• scientific article; zbMATH DE number 6863762 (Why is no real title available?)
• Fault-tolerant routing in hypercubes using probability vectors
• On graphs like hypercubes

This page was built for publication: Fault-tolerant fixed routing in hypercube generalizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q699637)