"Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data ..."

Surender Baswana, Neelesh Khanna (2013)

> Home

Details and statistics

DOI: 10.1007/S00453-012-9621-Y

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BaswanaK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BaswanaK13
Surender Baswana, Neelesh Khanna:
Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs. Algorithmica 66(1): 18-50 (2013)

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.