A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning Nathaniel Lahn
–Neural Information Processing Systems
Maximum cardinality bipartite matching is an important graph optimization problem with several applications.
Neural Information Processing Systems
Aug-15-2025, 20:21:08 GMT
- Country:
- North America > United States
- Virginia (0.04)
- Asia > Middle East
- Jordan (0.04)
- North America > United States
- Genre:
- Research Report (0.68)
- Technology: