A branch-and-cut algorithm for the k-edge connected subgraph problem
Data and Resources
Additional Info
| Field | Value |
|---|---|
| Source | ISSN: 0028-3045 |
| Author | Bendali, Fatiha, Diarrassouba, Ibrahima, Mahjoub, Ali Ridha, Didi Biha, Mohamed, Mailfert, Jean |
| Maintainer | CCSD |
| Last Updated | May 5, 2026, 17:09 (UTC) |
| Created | May 5, 2026, 17:09 (UTC) |
| Identifier | hal-00972575 |
| Language | en |
| contributor | Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes (LIMOS) ; Université Blaise Pascal - Clermont-Ferrand 2 (UBP)-Université d'Auvergne - Clermont-Ferrand I (UdA)-SIGMA Clermont (SIGMA Clermont)-Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS) |
| creator | Bendali, Fatiha |
| date | 2009-03-06T00:00:00 |
| harvest_object_id | 7b9d2056-b128-43f7-960e-8f112fc93210 |
| harvest_source_id | 3374d638-d20b-4672-ba96-a23232d55657 |
| harvest_source_title | test moissonnage SELUNE |
| metadata_modified | 2025-06-13T00:00:00 |
| relation | info:eu-repo/semantics/altIdentifier/doi/10.1002/net.20310 |
| set_spec | type:ART |