Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality

DOI10.1007/978-3-319-13075-0_60zbMath1435.05066DBLPconf/isaac/NasrePR14arXiv1411.4073OpenAlexW1563502124WikidataQ62045769 ScholiaQ62045769MaRDI QIDQ2942677

Matteo Pontecorvi, Vijaya Ramachandran, Meghana Nasre

Publication date: 11 September 2015

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.4073

zbMATH Keywords

all pairs all shortest paths problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (1)

The sparsest additive spanner via multiple weighted BFS trees

This page was built for publication: Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality