Hypercube Network Diameter
Hypercube Network Diameter is the longest shortest path length between any two nodes in an n-dimensional hypercube network, serving as a metric that quantifies the maximum communication delay in the network.
66
Publications
3.2K
Citations
131
Authors
91
Institutions
Publications per year
2017–2026
4
Parents
66
Paul Cull, Shawn M. Larson · IEEE Transactions on Computers · 1995 · 262 citations
Gurmeet Singh Manku, Moni Naor, Udi Wieder · 2004 · 208 citations
Nian-Feng Tzeng, S. Wei · IEEE Transactions on Computers · 1991 · 185 citations
1–5 of 66
131
4
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 131
91

National Yang Ming Chiao Tung University
Hsinchu, Taiwan
7 h-index
13 publications
449 citations
Charles University
Prague, Czechia
3 h-index
4 publications
94 citations
Oregon State University
Corvallis, United States
3 h-index
5 publications
334 citations

City University of Hong Kong
Hong Kong, Hong Kong
3 h-index
5 publications
394 citations

Zhejiang Normal University
Jinhua, China
3 h-index
4 publications
86 citations

Tokyo University of Agriculture and Technology
Tokyo, Japan
3 h-index
3 publications
45 citations
National Central University
Taoyuan City, Taiwan
2 h-index
4 publications
169 citations
University of Science and Technology of China
Hefei, China
2 h-index
3 publications
55 citations
1–8 of 91
TPDS · 10 publications · 614 citations
10
h-index
9 publications · 882 citations
9
h-index
5 publications · 175 citations
5
h-index
3 publications · 218 citations
3
h-index
3 publications · 112 citations
3
h-index
1–5