Issue No. 09 - September (2000 vol. 49)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.869331
<p><b>Abstract</b>—It is well-known that the minimum distance diagram of a double-loop network yields an L-shape. It is important to know, for a given L-shape, whether there exists a double-loop network realizing it. Necessary and sufficient conditions were given before, but were said to be cumbersome. They also need some clarification. We give new conditions and a simple proof. We also prove that all double-loop networks realizing the same L-shape are isomorphic as the existing proof was given in a Spanish dissertation.</p>
Double-loop network, L-shape, diameter, sieve method.
C. Chen and F. Hwang, "The Minimum Distance Diagram of Double-Loop Networks," in IEEE Transactions on Computers, vol. 49, no. , pp. 977-979, 2000.