Graph Embedding in Hypercube Networks is a computational method that maps the vertices and edges of an arbitrary graph into the vertices and edges of a hypercube network such that the structural relationships of the original graph are preserved under specific embedding constraints.
74
Publications
2.6K
Citations
134
Authors
81
Institutions
Publications per year
2017–2026
5
Parents
Publications
74
S.A. Choudum, V. Sunitha · Networks · 2002 · 152 citations
A class of hypercube-like networks
A.S. Vaidya, P.S. Nagendra Rao, Shiva Shankar · 2002 · 114 citations
1–5 of 74
Authors
134
- SH
4
h-index
- AJ
3
h-index
- ZM
3
h-index
- SC
3
h-index
- RH
3
h-index
1–5 of 134
Institutions
81
University of California, Irvine
Irvine, United States
4 h-index
6 publications
217 citations
The University of Texas at Dallas
Richardson, United States
4 h-index
8 publications
155 citations
National Cheng Kung University
Tainan City, Taiwan
4 h-index
6 publications
200 citations
Beijing Jiaotong University
Beijing, China
3 h-index
9 publications
290 citations
Miami University
Oxford, United States
3 h-index
7 publications
204 citations
Indian Institute of Technology Madras
Chennai, India
3 h-index
6 publications
360 citations
Montclair State University
Montclair, United States
2 h-index
2 publications
126 citations
Western Michigan University
Kalamazoo, United States
2 h-index
5 publications
148 citations
1–8 of 81
Venues
- IEEE Transactions on Computers
8 publications · 370 citations
8
h-index
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 7 publications · 336 citations
7
h-index
- Journal of Parallel and Distributed Computing
5 publications · 145 citations
5
h-index
- Information Processing Letters
4 publications · 82 citations
4
h-index
- Discrete Mathematics
3 publications · 70 citations
3
h-index
1–5