A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths

Cristina Bazgan, André Nichterlein, Rolf Niedermeier. A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. In Vangelis Th. Paschos, Peter Widmayer, editors, Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings. Volume 9079 of Lecture Notes in Computer Science, pages 47-60, Springer, 2015. [doi]

@inproceedings{BazganNN15,
  title = {A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths},
  author = {Cristina Bazgan and André Nichterlein and Rolf Niedermeier},
  year = {2015},
  doi = {10.1007/978-3-319-18173-8_3},
  url = {http://dx.doi.org/10.1007/978-3-319-18173-8_3},
  researchr = {https://researchr.org/publication/BazganNN15},
  cites = {0},
  citedby = {0},
  pages = {47-60},
  booktitle = {Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings},
  editor = {Vangelis Th. Paschos and Peter Widmayer},
  volume = {9079},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-18172-1},
}