Computer Science & AI · 1959
A Note on Two Problems in Connexion with Graphs
Edsger W. Dijkstra
Overview
Dijkstra's three-page note introduced two classic graph algorithms, including the shortest-path algorithm that now bears his name. It finds the minimum-cost route from a source to all other nodes in a weighted graph.
Dijkstra's algorithm underpins routing, navigation, and network analysis.
Key findings
Methods
An algorithmic construction: nodes are progressively added to a solved set in order of increasing distance from the source, greedily relaxing edges to neighbouring nodes.
Keywords
Related papers
Computer Science & AI
Highly Accurate Protein Structure Prediction with AlphaFold
AlphaFold solved a 50-year grand challenge in biology: predicting a protein's three-dimensional shape from its amino-acid sequence. Its accuracy approached that of experimental methods, transforming structural biology.
Computer Science & AI
Attention Is All You Need
The paper that introduced the Transformer, an architecture built entirely on attention mechanisms with no recurrence or convolution. It became the foundation of modern large language models such as GPT and BERT.
Computer Science & AI
Mastering the Game of Go with Deep Neural Networks and Tree Search
AlphaGo became the first program to beat a professional human at the ancient board game Go, long considered a grand challenge for AI because of its astronomical complexity. It combined deep neural networks with Monte Carlo tree search.