"Most vital vertices for the shortest s-t path problem: complexity and ..."

Youcef Magnouche, Sébastien Martin (2020)

> Home

Details and statistics

DOI: 10.1007/S11590-019-01527-5

access: closed

type: Journal Article

metadata version: 2021-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ol/MagnoucheM20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ol/MagnoucheM20
Youcef Magnouche, Sébastien Martin:
Most vital vertices for the shortest s-t path problem: complexity and Branch-and-Cut algorithm. Optim. Lett. 14(8): 2039-2053 (2020)

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.