Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs

Adam Karczmarz, Jakub Lacki. Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. In Michael A. Bender, Ola Svensson, Grzegorz Herman, editors, 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany. Volume 144 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]

@inproceedings{KarczmarzL19,
  title = {Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs},
  author = {Adam Karczmarz and Jakub Lacki},
  year = {2019},
  doi = {10.4230/LIPIcs.ESA.2019.65},
  url = {https://doi.org/10.4230/LIPIcs.ESA.2019.65},
  researchr = {https://researchr.org/publication/KarczmarzL19},
  cites = {0},
  citedby = {0},
  booktitle = {27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany},
  editor = {Michael A. Bender and Ola Svensson and Grzegorz Herman},
  volume = {144},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-124-5},
}