"A Sublinear-Time Algorithm for Nearly-Perfect Matchings in Regular ..."

Varsha Dani, Thomas P. Hayes (2025)

> Home

Details and statistics

DOI: 10.1137/1.9781611978322.166

access: closed

type: Conference or Workshop Paper

metadata version: 2025-01-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/soda/DaniH25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/DaniH25
Varsha Dani, Thomas P. Hayes:
A Sublinear-Time Algorithm for Nearly-Perfect Matchings in Regular Non-Bipartite Graphs. SODA 2025: 4899-4913

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.