Polyhedral study of the connected subgraph problem - Normandie Université Access content directly
Journal Articles Discrete Mathematics Year : 2015

Dates and versions

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

Identifiers

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⟩
37 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More