Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
From MaRDI portal
Publication:5289364
DOI10.1002/net.3230230403zbMath0780.90043OpenAlexW2019053322WikidataQ56287384 ScholiaQ56287384MaRDI QIDQ5289364
Ivan Stojmenović, Selim G. Akl, Ke Qiu
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
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel numerical computation (65Y05)
Related Items (10)
Fault tolerant routing in the star and pancake interconnection networks ⋮ The \((n,k)\)-star graph: A generalized star graph ⋮ Minimum time broadcast in faulty star networks ⋮ The (conditional) matching preclusion for burnt pancake graphs ⋮ Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults ⋮ Stability measures of some static interconnection networks ⋮ Largest connected component of a star graph with faulty vertices ⋮ On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network ⋮ Fault-tolerant routing in circulant networks and cycle prefix networks ⋮ Broadcasting in hypercubes and star graphs with dynamic faults.
Cites Work
This page was built for publication: Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
