Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs.
László BabaiAnna GálJános KollárLajos RónyaiTibor SzabóAvi WigdersonPublished in: STOC (1996)
Keyphrases
- bipartite graph
- lower bound
- upper bound
- maximum matching
- link prediction
- branch and bound algorithm
- np hard
- minimum weight
- branch and bound
- objective function
- worst case
- bipartite graph matching
- markov chain
- mutual reinforcement
- maximum cardinality
- graph theory
- random walk
- boolean functions
- graph clustering
- maximum weight
- training set