Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

Graph algorithms and spanners have emerged as a critical area of research in computer science, underpinning both theoretical advances and practical applications such as network design, routing ...

The legendary graph isomorphism problem may be harder than a 2015 result seemed to suggest. “In Laci Babai, you have one of the most legendary and fearsome theoretical computer scientists there ever ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

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 ...

Machine learning, task automation and robotics are already widely used in business. These and other AI technologies are about to multiply, and we look at how organizations can best take advantage of ...

Most of you have used a navigation app like Google Maps for your travels at some point. These apps rely on algorithms that compute shortest paths through vast networks. Now imagine scaling that task ...