SIGN IN
SIGN UP
A greedy hypercube-labeling algorithm
Full Text:
Pdf
Buy this Article
Authors:
D. Bhagavathi
Old Dominion University, Norfolk, VA
C. E. Grosch
Old Dominion University, Norfolk, VA
S. Olariu
Old Dominion University, Norfolk, VA
Published in:
· Proceeding
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
ACM
New York, NY
, USA
©1992
table of contents
ISBN:0-89791-506-2
doi>
10.1145/503720.503772
1992 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 7
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
gray-codes
greedy algorithms
hypercubes
interconnection networks
optimal algorithms
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder