Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Matching Algorithms Are Fast in Sparse Random Graphs."

Hannah Bast et al. (2006)

> Home

Details and statistics

DOI: 10.1007/S00224-005-1254-Y

access: closed

type: Journal Article

metadata version: 2020-12-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/BastMST06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/BastMST06
Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki:
Matching Algorithms Are Fast in Sparse Random Graphs. Theory Comput. Syst. 39(1): 3-14 (2006)

a service of

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.