Stop the war!
Остановите войну!
for scientists:
default search action
"A polynomial time heuristic for certain subgraph optimization problems ..."
Svatopluk Poljak, Daniel Turzík (1986)
- Svatopluk Poljak, Daniel Turzík:
A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound. Discret. Math. 58(1): 99-104 (1986)
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.