Graph Algorithms
Graph Algorithms is a subfield of algorithm design that focuses on the development and analysis of computational methods for solving problems related to graphs, specifically by exploiting their structural properties such as vertices, edges, and connectivity patterns.
37K
Publications
2.2M
Citations
41.4K
Authors
5.6K
Institutions
Publications per year
2017–2026
7.8K
Variants
Distributed-memory Parallel AlgorithmsParallel Approximation AlgorithmsParallel Numerical AlgorithmsParallel Randomized AlgorithmsShared-memory Parallel Algorithms
37K
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
Santo Fortunato · Physics Reports · 2009 · 11.3K citations · Full text
The igraph software package for complex network research
Gábor Csárdi, Tamás Nepusz · Medical Entomology and Zoology · 2006 · 10.4K citations
1–5 of 37K
41.4K
63
h-index
62
h-index
52
h-index
46
h-index
45
h-index
1–5 of 41.4K
5.6K
Carnegie Mellon University
Pittsburgh, United States
104 h-index
959 publications
97.1K citations
Massachusetts Institute of Technology
Cambridge, United States
102 h-index
754 publications
75.2K citations
Stanford University
Stanford, United States
98 h-index
595 publications
68.7K citations
University of California, Berkeley
Berkeley, United States
94 h-index
526 publications
59.2K citations

Tel Aviv University
Tel Aviv, Israel
87 h-index
722 publications
49.2K citations

University of Waterloo
Waterloo, Canada
83 h-index
635 publications
44.3K citations

Centre National de la Recherche Scientifique
Paris, France
78 h-index
1.3K publications
52K citations
Princeton University
Princeton, United States
78 h-index
482 publications
49K citations
1–8 of 5.6K
542 publications · 71.5K citations
125
h-index
896 publications · 45.3K citations
98
h-index
1.9K publications · 66.2K citations
98
h-index
Repository · 1.2K publications · 51.8K citations
96
h-index
JACM · 198 publications · 37.3K citations
88
h-index
1–5