Live briefing
Everything about Brandes' algorithm
Algorithm for finding important nodes in a graph
In network theory, Brandes' algorithm is an algorithm for calculating the betweenness centrality of vertices in a graph. The algorithm was first published in 2001 by Ulrik Brandes. Betweenness centrality, along with other measures of centrality, is an important measure in many real-world networks, such as social networks and computer networks. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Brandes' algorithmA 5-minute orientation
- Pick up a classic book: Introduction to AlgorithmsThe most-reprinted book on the subject
- Read the landmark paper: An Adaptive Version of Brandes' Algorithm for Betweenness CentralityCited 7 times
- Go sideways: Parallel single-source shortest path algorithmA closely related topic
- Go sideways: Group centralityA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
📚 Books worth reading
Introduction to AlgorithmsThomas H. Cormen, Charles E. Leiserson · 1990
Image analysis, classification, and change detection in remote sensingMorton John Canty · 2010
Ideals, varieties, and algorithmsDavid A. Cox, David Cox · 1992
Graphs, Networks and AlgorithmsDieter Jungnickel · 2006
Differential diagnosis and management for the chiropractorThomas A. Souza · 2000
Green CommunicationsJinsong Wu, Sundeep Rangan · 2012
Randomized Algorithms for Analysis and Control of Uncertain SystemsRoberto Tempo · 2005
Markov ChainsWai-Ki Ching · 2006
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Parallel single-source shortest path algorithm A central problem in algorithmic graph theory is the shortest path problem. One of the generalizations of the shortest path problem is known as the si…
- Group centrality In graph theory and network analysis, group centrality generalizes the concept of centrality to sets of nodes in a network. Introduced by Everett and Borgatti…
- Shortest-path tree In mathematics and computer science, a shortest-path tree rooted at a vertex v of a connected, undirected graph G is a spanning tree T of G, such that…
- Hopcroft–Karp algorithm In computer science, the Hopcroft–Karp algorithm (sometimes more accurately called the Hopcroft–Karp–Karzanov algorithm) is an algorithm that takes a bipartite…
- Wiener connector In network theory, the Wiener connector is a means of maximizing efficiency in connecting specified "query vertices" in a network. Given a connected, undirected…
- Dijkstra's algorithm Dijkstra's algorithm (/ˈdaɪk.strəz/, DYKE-strəz) is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent…
- Topological sorting In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge…
- Distance (graph theory) In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path (also called a graph…