General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching.

Tomer Ezra Michal Feldman Nick Gravin Zhihao Gavin Tang

Published in: EC (2022)

Keyphrases

bipartite graph
maximum cardinality
tight bounds
maximum matching
bipartite graph matching
minimum weight
graph model
maximum weight
graph clustering
upper bound
graph matching
learning algorithm
data sets
matching algorithm
endpoints
graph partitioning
bipartite networks
pairwise
object recognition