Bipartite Graph Matrices
Bipartite Graph Matrices is a matrix representation method that encodes the structure of a bipartite graph by organizing its adjacency relationships into a rectangular matrix form where rows and columns correspond to the two disjoint vertex sets and nonzero entries indicate edges between them.
200
Publications
7.4K
Citations
421
Authors
251
Institutions
Publications per year
2017–2026
34
Variants
Bipartite Adjacency Matrices
200
Norm-graphs and bipartite tur�n numbers
J�nos Koll�r, Lajos R�nyai, Tibor Szab� · COMBINATORICA · 1996 · 162 citations
A correlation inequality for bipartite graphs
Alexander Sidorenko · Graphs and Combinatorics · 1993 · 152 citations
1–5 of 200
421
4
h-index
4
h-index
3
h-index
3
h-index
Courant Institute of Mathematical Sciences, United States
3 publications · 243 citations
3
h-index
1–5 of 421
251
Simon Fraser University
Burnaby, Canada
6 h-index
6 publications
102 citations

Centre National de la Recherche Scientifique
Paris, France
5 h-index
12 publications
386 citations

University of Waterloo
Waterloo, Canada
5 h-index
6 publications
255 citations

University of Victoria
Victoria, Canada
4 h-index
9 publications
144 citations

Northwestern Polytechnical University
Xi'an, China
4 h-index
10 publications
220 citations
Tsinghua University
Beijing, China
4 h-index
8 publications
180 citations
University of California, Berkeley
Berkeley, United States
4 h-index
5 publications
94 citations

University of Electronic Science and Technology of China
Chengdu, China
4 h-index
8 publications
403 citations
1–8 of 251
28 publications · 688 citations
16
h-index
15 publications · 580 citations
12
h-index
7 publications · 195 citations
7
h-index
6 publications · 383 citations
6
h-index
6 publications · 161 citations
6
h-index
1–5