Stop the war!
Остановите войну!
for scientists:
default search action
"Parameterized complexity of coloring problems: Treewidth versus vertex cover."
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl (2011)
- Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Parameterized complexity of coloring problems: Treewidth versus vertex cover. Theor. Comput. Sci. 412(23): 2513-2523 (2011)
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.