Computer Scientists Establish the Best Way to Traverse a Graph
(quantamagazine.org)
Dijkstra’s algorithm was long thought to be the most efficient way to find a graph’s best routes. Researchers have now proved that it’s “universally optimal.”
Dijkstra’s algorithm was long thought to be the most efficient way to find a graph’s best routes. Researchers have now proved that it’s “universally optimal.”
The bunkbed conjecture is false
(wordpress.com)
The bunkbed conjecture (BBC) is a basic claim about random subgraphs.
The bunkbed conjecture (BBC) is a basic claim about random subgraphs.
Hierarchical Navigable Small World: a scalable nearest neighbor search
(github.com/brtholomy)
"Hierarchical Navigable Small World" (HNSW): an intriguing mouthful, designating a dense bouquet of concepts developed in the last 70 years in sociology, graph theory, and algorithmic science. In this brief tutorial, we'll examine these concepts carefully and attempt to solidify our understanding with proof-of-concept code and as many visualizations as possible.
"Hierarchical Navigable Small World" (HNSW): an intriguing mouthful, designating a dense bouquet of concepts developed in the last 70 years in sociology, graph theory, and algorithmic science. In this brief tutorial, we'll examine these concepts carefully and attempt to solidify our understanding with proof-of-concept code and as many visualizations as possible.
Graph Coloring Methods
(graphcoloringmethods.com)
This is a graduate textbook about how to color graphs.
This is a graduate textbook about how to color graphs.
Possibly all the ways to get loop-finding in graphs wrong
(greenend.org.uk)
Over the years I’ve been developing these puzzles, I’ve gone through an amazing number of algorithms for doing that job. Each one was unsatisfactory for some reason, and I threw it away, and moved on to the next.
Over the years I’ve been developing these puzzles, I’ve gone through an amazing number of algorithms for doing that job. Each one was unsatisfactory for some reason, and I threw it away, and moved on to the next.