Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub. The k-node-connected subgraph problem: Facets and Branch-and-Cut. In Prosper Chemouil, Achille Pattavina, Éric Gourdin, Stefano Secci, editors, 12th International Conference on the Design of Reliable Communication Networks, DRCN 2016, Paris, France, March 15-17, 2016. pages 1-8, IEEE, 2016. [doi]
@inproceedings{DiarrassoubaMM16,
title = {The k-node-connected subgraph problem: Facets and Branch-and-Cut},
author = {Ibrahima Diarrassouba and Meriem Mahjoub and Ali Ridha Mahjoub},
year = {2016},
doi = {10.1109/DRCN.2016.7470828},
url = {http://dx.doi.org/10.1109/DRCN.2016.7470828},
researchr = {https://researchr.org/publication/DiarrassoubaMM16},
cites = {0},
citedby = {0},
pages = {1-8},
booktitle = {12th International Conference on the Design of Reliable Communication Networks, DRCN 2016, Paris, France, March 15-17, 2016},
editor = {Prosper Chemouil and Achille Pattavina and Éric Gourdin and Stefano Secci},
publisher = {IEEE},
isbn = {978-1-4673-8496-4},
}