Optimal gray-code labeling and recognition algorithms for hypercubes

DOI10.1016/S0020-0255(01)00120-7zbMath0996.68140OpenAlexW2055168066MaRDI QIDQ1602516

Stavros D. Nikolopoulos

Publication date: 23 June 2002

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(01)00120-7

zbMATH Keywords

greedy algorithmGray-code labeling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

An algorithm for generating generalized splines on graphs such as complete graphs, complete bipartite graphs and hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix multiplication via arithmetic progressions
• Another characterization of hypercubes
• Convexity in graphs
• On cubical graphs
• A characterization of hypercubes
• Parallel concepts in graph theory
• Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs
• Minimal mesh embeddings in binary hypercubes
• Optimum broadcasting and personalized communication in hypercubes

This page was built for publication: Optimal gray-code labeling and recognition algorithms for hypercubes