Polyhedral study of the connected subgraph problem

Mohamed Didi Biha; Hervé L.M. Kerivin; Peh Ng

doi:10.1016/j.disc.2014.08.026

Journal Articles Discrete Mathematics Year : 2015

Polyhedral study of the connected subgraph problem

(1) , (2) , (3)

1
2
3

Mohamed Didi Biha

Function : Author
PersonId : 175567
IdHAL : mohamed-didi-biha
IdRef : 11067250X

Laboratoire de Mathématiques Nicolas Oresme

Hervé L.M. Kerivin

Function : Author
PersonId : 746928
IdHAL : herve-kerivin
ORCID : 0000-0002-1694-7640
IdRef : 186151586

Department of Mathematical Sciences [Clemson]

Peh Ng

Function : Author

University of Minnesota [Morris]

Domains

Mathematics [math]

Mohamed Didi Biha : Connect in order to contact the contributor

https://hal-normandie-univ.archives-ouvertes.fr/hal-02145375

Submitted on : Sunday, June 2, 2019-4:28:30 PM

Last modification on : Friday, March 24, 2023-2:53:11 PM

Dates and versions

hal-02145375 , version 1 (02-06-2019)

Identifiers

HAL Id : hal-02145375 , version 1
DOI : 10.1016/j.disc.2014.08.026

Cite

Mohamed Didi Biha, Hervé L.M. Kerivin, Peh Ng. Polyhedral study of the connected subgraph problem. Discrete Mathematics, 2015, 338 (1), pp.80-92. ⟨10.1016/j.disc.2014.08.026⟩. ⟨hal-02145375⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

CNRS INSMI COMUE-NORMANDIE UNICAEN LMNO

32 View

0 Download

Polyhedral study of the connected subgraph problem

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share