Shortest Path Centralities

In some applications, it makes sense to restrict attention to the shortest paths that connect any two vertices in a graph. Centrality measures that consider this include closeness centrality and betweenness centrality, which will both be discussed in this video. I conclude with a short summary of all approaches discussed so far.



► Full playlist for this course:    • Knowledge Graphs (lecture)  
► Lecture slides for download: https://iccl.inf.tu-dresden.de/web/KG... (Lecture 13)
► Related problem sheet to test your knowledge: Exercise 12
► Current and previous versions of the lecture: https://iccl.inf.tu-dresden.de/web/Kn...