BOOK-CHAPTER

Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality

Meghana NasreMatteo PontecorviVijaya Ramachandran

Year: 2014 Lecture notes in computer science Pages: 766-778   Publisher: Springer Science+Business Media
Keywords:
Betweenness centrality Combinatorics Shortest path problem Vertex (graph theory) Mathematics Computation Discrete mathematics Graph Centrality Algorithm

Metrics

7
Cited By
2.05
FWCI (Field Weighted Citation Impact)
14
Refs
0.88
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Complex Network Analysis Techniques
Physical Sciences →  Physics and Astronomy →  Statistical and Nonlinear Physics
Topological and Geometric Data Analysis
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Advanced Clustering Algorithms Research
Physical Sciences →  Computer Science →  Artificial Intelligence

Related Documents

BOOK-CHAPTER

Decremental All-Pairs Shortest Paths

Camil DemetrescuGiuseppe F. Italiano

Encyclopedia of Algorithms Year: 2016 Pages: 506-509
BOOK-CHAPTER

Decremental All-Pairs Shortest Paths

Camil DemetrescuGiuseppe F. Italiano

Encyclopedia of Algorithms Year: 2008 Pages: 226-227
JOURNAL ARTICLE

Near-Optimal Approximate Decremental All Pairs Shortest Paths

Shiri Chechik

Year: 2018 Vol: 28 Pages: 170-181
© 2026 ScienceGate Book Chapters — All rights reserved.