›Betweenness Centrality
1.7 · Lesson
Betweenness Centrality
In the previous lesson, we used iFull definition for PageRank (opens in a new tab)A centrality algorithm that scores a node by the number of nodes pointing at it and by how important those nodes are. to find influential papers in our citation network.
Now we'll explore a different question: Which papers serve as bridges between different research areas?
Join GraphAcademy to keep learning
Create your account to unlock 80+ hours of hands-on Neo4j courses, track your progress, and earn a certificate when you complete the course.
Sign in or register