Pages that link to "Item:Q5289364"

The following pages link to Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry (Q5289364):

Displaying 10 items.

• Fault-tolerant routing in circulant networks and cycle prefix networks (Q1305199) (← links)
• The \((n,k)\)-star graph: A generalized star graph (Q1352094) (← links)
• Minimum time broadcast in faulty star networks (Q1392530) (← links)
• On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network (Q1582646) (← links)
• Fault tolerant routing in the star and pancake interconnection networks (Q2365821) (← links)
• The (conditional) matching preclusion for burnt pancake graphs (Q2446329) (← links)
• Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults (Q2449066) (← links)
• Broadcasting in hypercubes and star graphs with dynamic faults. (Q2583571) (← links)
• Stability measures of some static interconnection networks (Q2720125) (← links)
• Largest connected component of a star graph with faulty vertices (Q3545669) (← links)