A new technique breaks Dijkstra's 70-year-old record: it finds routes faster in huge networks, changing graph theory forever.

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

Watt’s online MSc Computer Science blends academic expertise with practical, real-world teaching, including algorithm demos ...

The Saint Louis University Department of Computer Science is committed to the development and study of computing technologies for the greater good of humanity. SLU offers bachelor's, master's and ...