Document Type
Article
Publication Date
1994
DOI
10.1093/comjnl/37.2.124
Publication Title
Computer Journal
Volume
37
Issue
2
Pages
124-128
Abstract
Due to its attractive topological properties, the hypercube multiprocessor has emerged as one of the architectures of choice when it comes to implementing a large number of computational problems. In many such applications, Gray-code labelings of the hypercube are a crucial prerequisite for obtaining efficient algorithms. We propose a greedy algorithm that, given an n-dimensional hypercube H with N=22 nodes, returns a Gray-code labeling of H, that is, a labeling of the nodes with binary strings of length n such that two nodes are neighbors in the hypercube if, and only if, their labels differ in exactly one bit. Our algorithm is conceptually very simple and runs in O(N log N) time being, therefore, optimal. As it turns out, with a few modifications our labeling algorithm can be used to recognize hypercubes as well.
Original Publication Citation
Bhagavathi, D., Grosch, C. E., & Olariu, S. (1994). A greedy hypercube-labeling algorithm. Computer Journal, 37(2), 124-128. doi:10.1093/comjnl/37.2.124
Repository Citation
Bhagavathi, D., Grosch, C. E., & Olariu, S. (1994). A greedy hypercube-labeling algorithm. Computer Journal, 37(2), 124-128. doi:10.1093/comjnl/37.2.124
ORCID
0000-0002-3776-216X (Olariu)
Included in
Databases and Information Systems Commons, Software Engineering Commons, Theory and Algorithms Commons