Bipartite Matching
Bipartite Matching is a matching in a bipartite graph where each edge connects a vertex from one partition to a vertex in the other, such that no two edges share a common vertex, thereby maximizing the number of paired vertices under the constraint of pairwise disjointness.
797
Publications
44.9K
Citations
1.8K
Authors
687
Institutions
Publications per year
2017–2026
224
Parents
797
End-to-End Object Detection with Transformers
Nicolas Carion, Francisco Massa, Gabriel Synnaeve et al. · Lecture notes in computer science · 2020 · 831 citations · Full text
An optimal algorithm for on-line bipartite matching
Richard M. Karp, Umesh Vazirani, Vijay V. Vazirani · 1990 · 724 citations · Full text
AdWords and generalized online matching
Aranyak Mehta, Amin Saberi, Umesh Vazirani et al. · Journal of the ACM · 2007 · 622 citations
1–5 of 797
1.8K
10
h-index
9
h-index
8
h-index
6
h-index
6
h-index
1–5 of 1.8K
687
Stanford University
Stanford, United States
17 h-index
36 publications
2.8K citations
University of Maryland, College Park
College Park, United States
16 h-index
37 publications
1.7K citations
Carnegie Mellon University
Pittsburgh, United States
14 h-index
23 publications
1K citations
Google (United States)
Mountain View, United States
14 h-index
32 publications
5.5K citations
Tsinghua University
Beijing, China
13 h-index
31 publications
1.1K citations
University of California, Berkeley
Berkeley, United States
13 h-index
18 publications
2K citations
University of Michigan
Ann Arbor, United States
12 h-index
16 publications
748 citations
Georgia Institute of Technology
Atlanta, United States
12 h-index
21 publications
2.2K citations
1–8 of 687
Repository · 39 publications · 1.1K citations
19
h-index
19 publications · 4.3K citations
16
h-index
19 publications · 577 citations
14
h-index
14 publications · 411 citations
13
h-index
11 publications · 337 citations
10
h-index
1–5