The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A recursive network is said to be with complete connection if its subnetworks are connected as a complete graph. In this paper, a general broadcasting scheme is proposed for recursive networks with complete connection. The scheme is simple, efficient, and easy to be implemented. Besides, there is no redundant message generated. Broadcasting algorithms for the hypercomplete, hypernet, WK-recursive,...
The incomplete WK-recursive networks have been recently proposed to relieve the restriction on the sizes of the WK-recursive networks. In this paper, a maximal set of node-disjoint paths is constructed between arbitrary two nodes of an incomplete WK-recursive network. The effectiveness of the constructed paths is verified by both theoretic analysis and extensive experiments. A tight upper bound on...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.