"Matching Algorithms Are Fast in Sparse Random Graphs."

Hannah Bast et al. (2004)

> Home

Details and statistics

DOI: 10.1007/978-3-540-24749-4_8

access: closed

type: Conference or Workshop Paper

metadata version: 2020-12-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stacs/BastMST04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/BastMST04
Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki:
Matching Algorithms Are Fast in Sparse Random Graphs. STACS 2004: 81-92

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.