"The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut."

Ibrahima Diarrassouba et al. (2016)

> Home

Details and statistics

DOI: 10.1016/J.ENDM.2016.03.016

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/endm/DiarrassoubaMMT16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/DiarrassoubaMMT16
Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub, Raouia Taktak:
The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut. Electron. Notes Discret. Math. 52: 117-124 (2016)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.