Bipartite Graph Representation
Bipartite Graph Representation is a hypergraph visualization method that encodes a hypergraph as a bipartite graph by distinguishing two disjoint sets of nodes—hypernodes and hyperedges—such that incidences between hypernodes and hyperedges in the original hypergraph are represented as binary edges in the bipartite structure.
877
Publications
45.6K
Citations
2.3K
Authors
830
Institutions
Publications per year
2017–2026
286
Parents
877
Graph Convolutional Matrix Completion
Rianne van den Berg, Thomas Kipf, Max Welling · arXiv (Cornell University) · 2017 · 1.1K citations · Full text
Bipartite network projection and personal recommendation
Tao Zhou, Jie Ren, Matúš Medo et al. · Physical Review E · 2007 · 1.1K citations · Full text
Endre Szemerédi · Defense Technical Information Center (DTIC) · 1975 · 806 citations
1–5 of 877
2.3K
12
h-index
8
h-index
8
h-index
6
h-index
6
h-index
1–5 of 2.3K
830

Northwestern Polytechnical University
Xi'an, China
15 h-index
47 publications
1.8K citations
University of California, Berkeley
Berkeley, United States
15 h-index
26 publications
3.9K citations

Peking University
Beijing, China
15 h-index
44 publications
1.9K citations
Tsinghua University
Beijing, China
14 h-index
33 publications
2K citations

Centre National de la Recherche Scientifique
Paris, France
12 h-index
32 publications
1.2K citations
University of Illinois Urbana-Champaign
Urbana, United States
12 h-index
28 publications
1.1K citations
National University of Singapore
Singapore, Singapore
11 h-index
20 publications
2.4K citations

Chinese Academy of Sciences
Beijing, China
11 h-index
25 publications
508 citations
1–8 of 830
56 publications · 1.3K citations
20
h-index
20 publications · 1.1K citations
17
h-index
22 publications · 717 citations
15
h-index
TKDE · 16 publications · 1.1K citations
14
h-index
Repository · 18 publications · 1.7K citations
12
h-index
1–5