"A Faster Maximum Cardinality Matching Algorithm with Applications in ..."

Nathaniel Lahn, Sharath Raghvendra, Jiacheng Ye (2021)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2022-05-03

- view
  - electronic edition @ neurips.cc (open access)
- export record
  dblp key:
  - conf/nips/LahnRY21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nips/LahnRY21
Nathaniel Lahn, Sharath Raghvendra, Jiacheng Ye:
A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning. NeurIPS 2021: 16885-16898

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.