 |
|
|
|
| HAL: hal-00479645, version 1 |
| Detailed view |  Export this paper |
|
|
| WG'2010 : 36th International Workshop on Graph-Theoretic Concepts in Computer Science, Zarós : Greece (2010) |
|
|
|
|
| Solving Capacitated Dominating Set by using Covering by Subsets and Maximum Matching |
|
|
| Mathieu Liedloff 1Ioan Todinca 1 |
|
|
| (2010) |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
| 2: | Department of Informatics |
|
|
|
University of Bergen |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Data Structures and Algorithms |
| hal-00479645, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00479645 | |
| oai:hal.archives-ouvertes.fr:hal-00479645 | |
| From: Mathieu Liedloff | |
| Submitted on: Saturday, 1 May 2010 14:01:34 | |
| Updated on: Monday, 15 November 2010 21:18:19 | |
