Algorithms for efficient identification of operational subcubes in faulty hypercubes

Two heuristic algorithms are proposed for operational subcube identification in hypercubes with faulty nodes. Either of the algorithms can adaptively construct a complete binary tree based on the fault set such that subcube identification is greatly enhanced. They can be used to modify the standard Gray code or buddy strategy to provide remarkable performance improvement in the identification of higher dimensional operation subcubes with practical time complexities that make them attractive. In essence, the algorithms provide preprocessing techniques based on recursive splitting of the faulty hypercube so that a large number of high dimensional subcubes can be identified. For the identification part, existing schemes can be used to actually harvest the subcubes