#graph theory

2 stories

#algorithm #binomial graphs #c-hd #computational complexity #conjecture proof #daniel iľkovič #dijkstra #directed graph #formal verification #kim-vu conjecture #lean #mathematical proof

C-HD Algorithm Achieves Faster Shortest Path Computation
New algorithm finds exact shortest paths in directed graphs with non-negative weights faster than Dijkstra's method for specific input sizes.
Vals · 1m
Mathematicians Prove the Graph Sandwich Conjecture
A 22-year-old mathematical puzzle about connecting two types of random graphs has finally been solved, opening new ways to study complex networks.
Quanta Magazine · 3m