Stop the war!
Остановите войну!
for scientists:
default search action
"Complexity and approximation results for the connected vertex cover ..."
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot (2010)
- Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. J. Discrete Algorithms 8(1): 36-49 (2010)
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.