完整後設資料紀錄
DC 欄位語言
dc.contributor.authorChen, CYen_US
dc.contributor.authorHwang, FKen_US
dc.date.accessioned2014-12-08T15:44:50Z-
dc.date.available2014-12-08T15:44:50Z-
dc.date.issued2000-09-01en_US
dc.identifier.issn0018-9340en_US
dc.identifier.urihttp://dx.doi.org/10.1109/12.869331en_US
dc.identifier.urihttp://hdl.handle.net/11536/30267-
dc.description.abstractIt is well-known that the minimum distance diagram of st 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.en_US
dc.language.isoen_USen_US
dc.subjectdouble-loop networken_US
dc.subjectL-shapeen_US
dc.subjectdiameteren_US
dc.subjectsieve methoden_US
dc.titleThe minimum distance diagram of double-loop networksen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/12.869331en_US
dc.identifier.journalIEEE TRANSACTIONS ON COMPUTERSen_US
dc.citation.volume49en_US
dc.citation.issue9en_US
dc.citation.spage977en_US
dc.citation.epage979en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000089459600012-
dc.citation.woscount13-
顯示於類別:期刊論文


文件中的檔案:

  1. 000089459600012.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。