Node-ranking schemes for the star networks.

DOI10.1016/S0743-7315(02)00056-4zbMATH Open1055.68003OpenAlexW2156367848MaRDI QIDQ1402111FDOQ1402111

Authors: Abdel-Elah Al-Ayyoub, K. Day 

Publication date: 19 August 2003

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(02)00056-4

Recommendations

• The hyperstar interconnection network
• The \((n,k)\)-star graph: A generalized star graph
• scientific article; zbMATH DE number 2040828
• Order preserving communication on a star network
• EFFICIENT ALGORITHMS ON THE HYPERSTAR NETWORK

zbMATH Keywords

Interconnection networksParallel processingStar graphsNode ranking

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited In (6)

• Largest connected component of a star graph with faulty vertices
• Ranking nodes in general networks: a Markov multi-chain approach
• EFFICIENT ALGORITHMS ON THE HYPERSTAR NETWORK
• A novel routing scheme on the star and pancake networks and its applications
• Title not available (Why is that?)
• Matrix representation of a Staran interconnecting network

This page was built for publication: Node-ranking schemes for the star networks.

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