Stop the war!
Остановите войну!
for scientists:
default search action
"Maximum flow is approximable by deterministic constant-time algorithm in ..."
Endre Csóka (2010)
- Endre Csóka:
Maximum flow is approximable by deterministic constant-time algorithm in sparse networks. CoRR abs/1005.0513 (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.