Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry

DOI10.1002/NET.3230230403MaRDI QIDQ5289364zbMATH OpenOpenAlexWikidataFDO

Authors Selim G. Akl, Ke Qiu, Ivan Stojmenović

Publication date 23 August 1993

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230230403

zbMATH Keywords

computational geometryparallel computerdata communication schemesstar and pancake networks

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Programming involving graphs or networks (90C35) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Communication networks in operations research (90B18)

Recommendations

• A novel routing scheme on the star and pancake networks and its applications
• scientific article; zbMATH DE number 1185587
• On the embedding of cycles in pancake graphs
• EFFICIENT ALGORITHMS ON THE HYPERSTAR NETWORK
• scientific article; zbMATH DE number 1953271

Cites work

• Broadcasting on recursively decomposable Cayley graphs

Cited in

(14)

• Largest connected component of a star graph with faulty vertices
• A novel routing scheme on the star and pancake networks and its applications
• Minimum time broadcast in faulty star networks
• The \((n,k)\)-star graph: A generalized star graph
• scientific article; zbMATH DE number 1185587 (Why is no real title available?)
• The (conditional) matching preclusion for burnt pancake graphs
• A comparative study of job allocation and migration in the pancake network
• Stability measures of some static interconnection networks
• Fault-tolerant routing in circulant networks and cycle prefix networks
• Broadcasting in hypercubes and star graphs with dynamic faults.
• Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults
• EFFICIENT ALGORITHMS ON THE HYPERSTAR NETWORK
• Fault tolerant routing in the star and pancake interconnection networks
• On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network

This page was built for publication: Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry

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