Abstract
Simple formulas are derived to construct inorder spanning trees in a hypercube network. We identify a routing strategy to ensure the edge-disjointness of the routing paths in executing binary tree algorithms. Large trees can be built in a small hypercube by spreading the load congestion uniformly across the nodes of the hypercube. We also discuss the fault tolerance of the embedding method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
