00000cab a22000003a 4500 UP-99796217608682206 Buklod 20231007234629.0 m |o d | ta 090127s xx d | ||r ||||| || (iLib)UPD-00073796823 DENGII eng Jing, Hsu Wen Linear recursive networks and their applications in topological design and data routing. pp. 249-257 We present a new class of interconnection topologies called the Linear Recursive Networks. It is shown that each member of this fairly large class of network topologies possesses a recursively-decomposable structure. The path and connectivity properties of the entire class of networks are analyzed and found to have useful features. It is also demonstrated that Point-To-Point or Broadcasting/Gathering operations can be performed efficiently on all Linear Recursive Networks. The preliminary results suggest that the Linear Recursive Networks potentially have many applications. Computer systems organization. Computer communication networks. Network architecture and design. Network topology. Distributed networks. Mathematics of computing. Discrete mathematics. Graph theory. Network problems. Trees. Design. Languages. Theory. Verification. Computer communication review. 23, 4 (1993). FO UPD DENG-II Article