"Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time."

Prasad Chebolu, Alan M. Frieze, Páll Melsted (2008)

> Home

Details and statistics

DOI: 10.1007/978-3-540-70575-8_14

access: closed

type: Conference or Workshop Paper

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icalp/CheboluFM08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/CheboluFM08
Prasad Chebolu, Alan M. Frieze, Páll Melsted:
Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. ICALP (1) 2008: 161-172

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.