Stop the war!
Остановите войну!
for scientists:
default search action
"Matching Algorithms Are Fast in Sparse Random Graphs."
Hannah Bast et al. (2006)
- 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)
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.