An algorithm to find optimal double-loop networks

MaRDI QIDQ3402843zbMATH OpenFDO

Authors Jianqin Zhou

Publication date 12 February 2010

zbMATH Keywords

diameterdouble-loop networksinfinite familytight optimum

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On \(k\)-tight optimal double-loop networks
• An algorithm to find k-tight optimal double-loop networks.
• An efficient algorithm to find optimal double loop networks
• scientific article; zbMATH DE number 19191
• Minimal diameter double-loop networks. I. Large infinite optimal families

Cited in

(11)

• A simple algorithm to find the steps of double-loop networks
• An efficient algorithm to find optimal double loop networks
• An efficient algorithm to find a double-loop network that realizes a given L-shape
• An algorithm to find k-tight optimal double-loop networks.
• scientific article; zbMATH DE number 109210 (Why is no real title available?)
• scientific article; zbMATH DE number 2143949 (Why is no real title available?)
• scientific article; zbMATH DE number 1854091 (Why is no real title available?)
• scientific article; zbMATH DE number 1432345 (Why is no real title available?)
• On \(k\)-tight optimal double-loop networks
• Computational and Information Science
• Optimal routing in double loop networks

This page was built for publication: An algorithm to find optimal double-loop networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3402843)