Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry-Reference-Cited by-同舟云学术

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

Published:1993-07 Issue:4 Volume:23 Page:215-225
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Akl S. G.,Qiu K.,Stojmenović I.

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference19 articles.

1. A group-theoretic model for symmetric interconnection networks

2. , and , The star graph: An attractive alternative to the n-cube. Proceedings of the International Conference on Parallel Processing, St. Charles, IL (1987) 393–400.

3. and , The fault tolerance of star graphs. (L. P. Kartashev and S. I. Kartashev, Eds.). 2nd International Conference on Supercomputing, San Francisco (1987) Vol. III, 270–276.

4. and , Parallel Computational Geometry. Prentice-Hall, Englewood Cliffs, NJ (1993).

5. A novel routing scheme on the star and pancake networks and its applications

Cited by 44 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Constructing Independent Spanning Trees on Pancake Networks;IEEE Access;2020

2. A Parallel Construction of Vertex-Disjoint Spanning Trees with Optimal Heights in Star Networks;Combinatorial Optimization and Applications;2017

3. An Improved Algorithm for the Node-to-Set Disjoint Paths Problem on Bi-Rotator Graphs;Journal of Interconnection Networks;2016-09

4. Fault-Tolerant Routing in (n, k) - Star Graphs;2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies;2014-12

5. Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults;Discrete Applied Mathematics;2014-05