Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality

Meghana Nasre; Matteo Pontecorvi; Vijaya Ramachandran

doi:10.1007/978-3-319-13075-0_60

ScienceGate Book Chapters

BOOK-CHAPTER

Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality

Meghana Nasre Matteo Pontecorvi Vijaya Ramachandran

Year: 2014 Lecture notes in computer science Pages: 766-778 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-319-13075-0_60

Get Full-Text PDF Get Analytical Report

Keywords:

Betweenness centrality Combinatorics Shortest path problem Vertex (graph theory) Mathematics Computation Discrete mathematics Graph Centrality Algorithm

Metrics

Cited By

2.05

FWCI (Field Weighted Citation Impact)

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

Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality

Metrics

Citation History

Topics

Related Documents

Decremental All-Pairs Shortest Paths

Decremental All-Pairs Shortest Paths

Near-Optimal Approximate Decremental All Pairs Shortest Paths

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths

Decremental all-pairs shortest paths in deterministic near-linear time