default search action
"Approximating the minimum strongly connected subgraph via a matching lower ..."
Adrian Vetta (2001)
- Adrian Vetta:
Approximating the minimum strongly connected subgraph via a matching lower bound. SODA 2001: 417-426
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.