"A more fine-grained complexity analysis of finding the most vital edges ..."

Cristina Bazgan et al. (2019)

> Home

Details and statistics

DOI: 10.1002/NET.21832

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/BazganFNNS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/BazganFNNS19
Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg:
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths. Networks 73(1): 23-37 (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.