default search action
"Hardness results and approximation algorithms of k-tuple domination in graphs."
Ralf Klasing, Christian Laforest (2004)
- Ralf Klasing, Christian Laforest:
Hardness results and approximation algorithms of k-tuple domination in graphs. Inf. Process. Lett. 89(2): 75-83 (2004)
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.