The following pages link to Abdol-Hossein Esfahanian (Q1095927):
Displaying 21 items.
- On computing a conditional edge-connectivity of a graph (Q1095928) (← links)
- Chordal rings as fault-tolerant loops (Q1199459) (← links)
- Adaptive multicast wormhole routing in 2D mesh multicomputers (Q1898193) (← links)
- Some results about the inset edge and average distance of trees (Q2104937) (← links)
- (Q2869342) (← links)
- Link-Based Network Mining (Q3064408) (← links)
- On computing the connectivities of graphs and digraphs (Q3330525) (← links)
- Fault-Tolerant Routing in DeBruijn Comrnunication Networks (Q3680762) (← links)
- Lower-bounds on the connectivities of a graph (Q3815344) (← links)
- A message-routing strategy for multicomputer systems (Q4022729) (← links)
- (Q4028114) (← links)
- (Q4288087) (← links)
- (Q4522068) (← links)
- (Q4693368) (← links)
- (Q4693383) (← links)
- (Q4763334) (← links)
- (Q4873808) (← links)
- (Q4891871) (← links)
- Source-limited inclusive routing: A new paradigm for multicast communication (Q4944741) (← links)
- On Constructing Regular Distance-Preserving Graphs (Q5251988) (← links)
- The twisted N-cube with application to multiprocessing (Q5375382) (← links)
