1. Ausiello, G., Balzotti, L., Franciosa, P.G., Lari, I., Ribichini, A.: A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs, CoRR, abs/2204.10568 (2022)
2. Ausiello, G., Franciosa, P.G., Lari, I., Ribichini, A.: Max flow vitality in general and ST-planar graphs. Networks 74, 70–78 (2019)
3. Baker, Z.K., Gokhale, M.B.: On the acceleration of shortest path calculations in transportation networks. In: IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM 2007, pp. 23–34 (2007)
4. Balzotti, L., Franciosa, P.G.: Computing Lengths of Non-Crossing Shortest Paths in Planar Graphs, CoRR, abs/2011.04047 (2020)
5. Balzotti, L., Franciosa, P.G.: Max Flow Vitality of Edges and Vertices in Undirected Planar Graphs, CoRR, abs/2201.13099 (2022)