Dijkstra’s algorithm is a classic algorithm for doing route planning. Given a starting location it finds shortest paths from to all other reachable locations using the greedy method. Not only does it find shortest paths, it finds these in increasing order by length. A natural question is whether this algorithm is best possible. The answer […]
National Science Week 2025: Decoding the Universe – Exploring the unknown with nature’s hidden language Saturday August 16 from 12 – 4pmSunday August 17 from 12 – 4 pm To mark National Science Week, the Sydney Mathematical Research Institute (SMRI) and the Chau Chak Wing Museum (CCWM) are collaborating again on a stimulating weekend for […]
Knots are everywhere: in the strings of our DNA, in the structure of super-strong materials, and in mathematics, where knots lurk behind all three-dimensional shapes. Graphs model social networks, transit maps, neural nets, and are one of the most basic objects in modern combinatorics. But what does the mathematics of knots have to do with the mathematics of […]
