A delay optimal coterie on the k-dimensional folded Petersen graph

DOI10.1016/S0743-7315(03)00116-3MaRDI QIDQ1877620zbMATH OpenOpenAlexFDO

Authors P. C. Saxena, Sangita Gupta, Jagmohan Rai

Publication date 19 August 2004

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0743-7315(03)00116-3

zbMATH Keywords

Communication delayCoterieMessage complexityMutual exclusion

Mathematics Subject Classification ID

Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2088433
• A distributed k-mutual exclusion algorithm using k-coterie
• Optimal coteries for rings and related networks
• scientific article; zbMATH DE number 125485
• Topology and routing algorithms of double-loops connected Petersen graph networks

Cited in

(4)

• scientific article; zbMATH DE number 2088433 (Why is no real title available?)
• Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks
• Optimal coteries for rings and related networks
• Enhancing reliability of folded Petersen networks based on edge partition

This page was built for publication: A delay optimal coterie on the \(k\)-dimensional folded Petersen graph

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