Author:
Bilò Davide,Choudhary Keerti,Cohen Sarel,Friedrich Tobias,Krogmann Simon,Schirneck Martin
Publisher
Springer Nature Switzerland
Reference36 articles.
1. Afek, Y., Bremler-Barr, A., Kaplan, H., Cohen, E., Merritt, M.: Restoration by path concatenation: fast recovery of MPLS paths. Distrib. Comput. 15, 273–283 (2002). https://doi.org/10.1007/s00446-002-0080-6
2. Alon, N., Chechik, S., Cohen, S.: Deterministic combinatorial replacement paths and distance sensitivity oracles. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, (ICALP), pp. 12:1–12:14 (2019). https://doi.org/10.4230/LIPIcs.ICALP.2019.12
3. Baswana, S., Khanna, N.: Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs. Algorithmica 66, 18–50 (2013). https://doi.org/10.1007/s00453-012-9621-y
4. Bernstein, A., Karger, D.R.: Improved distance sensitivity oracles via random sampling. In: Proceedings of the 19th Symposium on Discrete Algorithms (SODA), pp. 34–43 (2008). https://dl.acm.org/doi/abs/10.5555/1347082.1347087
5. Bernstein, A., Karger, D.R.: A nearly optimal oracle for avoiding failed vertices and edges. In: Proceedings of the 41st Symposium on Theory of Computing (STOC), pp. 101–110 (2009). https://doi.org/10.1145/1536414.1536431