A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs (Maximum semi-matching problem in bipartite graphs)

Nearby in the stack

A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs (Maximum semi-matching problem in bipartite graphs) · arXivDesk

Nearby in the stack

A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs (Maximum semi-matching problem in bipartite graphs)

Claims

Methods

Limitations

Nearby in the stack

Perfect Matchings in Õ(n^{1.5}) Time in Regular Bipartite Graphs

A note on a generalization of eigenvector centrality for bipartite graphs and applications

Subsequence Covers of Words

Good covers are algorithmically unrecognizable

Semi-Online Bipartite Matching

Defensive Boosting for Online Probabilistic Forecasting

Perfect Matchings in Õ(n^{1.5}) Time in Regular Bipartite Graphs

A note on a generalization of eigenvector centrality for bipartite graphs and applications

Subsequence Covers of Words

Good covers are algorithmically unrecognizable

Semi-Online Bipartite Matching

Defensive Boosting for Online Probabilistic Forecasting