default search action
"Reducing the minimum T-cut problem to polynomial size linear programming."
Rüdiger Stephan (2011)
- Rüdiger Stephan:
Reducing the minimum T-cut problem to polynomial size linear programming. CTW 2011: 255-258
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.