Hyperedge Routing
Hyperedge Routing is a computational method in hypergraph visualization that determines the geometric pathways connecting multiple nodes through a hyperedge, distinguishing itself by explicitly modeling the spatial embedding and routing logic of set-based relationships in non-pairwise networks.
4
Publications
188
Citations
11
Authors
3
Institutions
Publications per year
2017–2026
1
Parents
4
1–4 of 4
11
2
h-index
University of Illinois Urbana-Champaign, United States
2 publications · 27 citations
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 11
1 publications · 95 citations
1
h-index
TODAES · 1 publications · 17 citations
1
h-index
Conference · 1 publications · 10 citations
1
h-index
1 publications · 66 citations
1
h-index
1–4