"Polynomial and pseudo-polynomial time algorithms for different classes of ..."

Roberto Aringhieri et al. (2019)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2017.12.035

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/AringhieriGHS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/AringhieriGHS19
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia:
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem. Discret. Appl. Math. 253: 103-121 (2019)

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.