"Maximum Cardinality f-Matching in Time ..."

Harold N. Gabow (2025)

> Home

Details and statistics

DOI: 10.1145/3696668

access: closed

type: Journal Article

metadata version: 2025-01-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/Gabow25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/Gabow25
Harold N. Gabow:
Maximum Cardinality f-Matching in Time O(n^2/3m). ACM Trans. Algorithms 21(1): 9:1-9:28 (2025)

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.