A combinatorial problem related to distributed loop networks

DOI10.1002/net.3230200204zbMath0696.90075OpenAlexW2062954789MaRDI QIDQ3474494

Qiao Li, D. Frank Hsu, Ding-Zhu Du, Jun-Ming Xu

Publication date: 1990

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230200204

zbMATH Keywords

diametertightnesslower boundring networksloop network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (9)

An optimal message routing algorithm for double-loop networks ⋮ A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ Fault-tolerant routings in double fixed-step networks ⋮ Unnamed Item ⋮ Cycle Kronecker products that are representable as optimal circulants ⋮ Distributed loop network with minimum transmission delay ⋮ Isomorphisms of circulant digraphs ⋮ Unnamed Item ⋮ On the crossing numbers of loop networks and generalized Petersen graphs

This page was built for publication: A combinatorial problem related to distributed loop networks