{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T14:27:08Z","timestamp":1775140028408,"version":"3.50.1"},"reference-count":27,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":4423,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1994,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Recently, with the support of the CAPRI (Concurrent Architecture and PRogramming environment for highly Integrated system) project, Vecchia and Sanges proposed a new general class of recursively scalable networks, termed WK\u2010recursive networks, and developed routing and broadcasting algorithms on them. They have also implemented the WK\u2010recursive networks using VLSI technology. This paper studies WK\u2010recursive networks by first investigating their topological properties such as diameter, connectivity, and Hamiltonicity. We then develop new and more efficient routing and broadcasting algorithms. Our routing algorithm can guarantee the shortest paths. Our broadcasting algorithm is much simpler and requires fewer extra bits to be transmitted. The broadcasting tree of our broadcasting algorithm is of minimal height (equal to the diameter), and each node receives the message exactly once. Moreover, we show the execution of descend\/ ascend algorithms on the WK\u2010recursive networks using the bitonic sort as an illustrative example. \u00a9 1994 by John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/net.3230240602","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T18:49:54Z","timestamp":1178995794000},"page":"303-317","source":"Crossref","is-referenced-by-count":55,"title":["Topological properties, communication, and computation on WK\u2010recursive networks"],"prefix":"10.1002","volume":"24","author":[{"given":"Gen\u2010Huey","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dyi\u2010Rong","family":"Duh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"S. B.Akers.D.Harel andB.Krishnamurthy The star graph: An attractive alternative to the n\u2010cube.Proceed. Int. Conf. Parallel Process.(1987)393\u2013400."},{"key":"e_1_2_1_3_2","first-page":"307","article-title":"Sorting networks and their applications","volume":"32","author":"Batcher K. E.","year":"1968","journal-title":"Proceed. AFIPS Spring Joint Comput. Conf."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676437"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/12.83652"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(91)90131-R"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/12.53600"},{"key":"e_1_2_1_9_2","article-title":"On the combinatorial properties of WK\u2010recursive networks","author":"Duh D. R.","journal-title":"J. Parallel Distrib. Comput."},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(90)90010-M"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/71.80187"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/12.67323"},{"key":"e_1_2_1_13_2","first-page":"76","article-title":"Recursive interconnection networks for multicomputer networks","volume":"1","author":"Fernandes R.","year":"1992","journal-title":"Proceed. Int. Conf. Parallel Process."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/71.113079"},{"key":"e_1_2_1_15_2","first-page":"355","article-title":"The design and evaluation of the hierarchical cubic network","volume":"1","author":"Ghose K.","year":"1990","journal-title":"Proceed. Int. Conf. Parallel Process."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(90)90131-8"},{"key":"e_1_2_1_17_2","doi-asserted-by":"crossref","unstructured":"D. F. Hsu Ed. interconnection Networks and Algorithms.Networks (Special Issue)23 (4) (1993).","DOI":"10.1002\/net.3230230402"},{"key":"e_1_2_1_18_2","article-title":"On container width and length in graphs, groups, and networks","author":"Hsu D. F.","year":"1994","journal-title":"IEICE Transactions on Fundamentals"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.5009497"},{"key":"e_1_2_1_20_2","unstructured":"INMOS Ltd. Transputer Reference Manual(1985)."},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/71.113081"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/12.90248"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/358645.358660"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/12.2234"},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-739X(88)90007-6"},{"issue":"4","key":"e_1_2_1_26_2","first-page":"235","article-title":"An optimized broadcasting technique for WK\u2010recursive topologies","volume":"5","author":"Vecchia G. D.","year":"1990","journal-title":"Future Generat. Comput. Syst."},{"key":"e_1_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(89)90033-6"},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/71.80144"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230240602","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230240602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T03:00:39Z","timestamp":1698116439000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230240602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["10.1002\/net.3230240602"],"URL":"https:\/\/doi.org\/10.1002\/net.3230240602","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}