Stop the war!
Остановите войну!
for scientists:
default search action
"Tight Complexity Bounds for FPT Subgraph Problems Parameterized by ..."
Hajo Broersma, Petr A. Golovach, Viresh Patel (2011)
- Hajo Broersma, Petr A. Golovach, Viresh Patel:
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. IPEC 2011: 207-218
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.