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

Distributed algorithms for graph problems represent a vibrant area of study that addresses the challenges of decentralised computation across interconnected networks. By partitioning complex graph ...

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a public transportation network. Mathematicians have long sought to develop ...

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

A professor has helped create a powerful new algorithm that uncovers hidden patterns in complex networks, with potential uses in fraud detection, biology and knowledge discovery. University of ...

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

A group of researchers at the Massachusetts Institute of Technology have devised a potentially more effective way of helping computers solve some of the toughest optimization problems they face. Their ...