"Finding a maximum matching in a sparse random graph in O(n) ..."

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

> Home

Details and statistics

DOI: 10.1145/1734213.1734218

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/CheboluFM10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/CheboluFM10
Prasad Chebolu, Alan M. Frieze, Páll Melsted:
Finding a maximum matching in a sparse random graph in O(n) expected time. J. ACM 57(4): 24:1-24:27 (2010)

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.