"Finding maximum matchings in random regular graphs in linear expected time."

Michael Anastos, Alan M. Frieze (2021)

> Home

Details and statistics

DOI: 10.1002/RSA.20980

access: closed

type: Journal Article

metadata version: 2021-03-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/AnastosF21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/AnastosF21
Michael Anastos, Alan M. Frieze:
Finding maximum matchings in random regular graphs in linear expected time. Random Struct. Algorithms 58(3): 390-429 (2021)

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.