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

Graph algorithms constitute a pivotal component of modern computational science, underpinning diverse applications ranging from transportation optimisation and telecommunications to social network ...

references therein), not much has been done to date for efficiently solving the project scheduling problem in AND-OR graphs. A special case, in which arc lengths are positive, has been studied by ...

In recent years, the Massively Parallel Computation (MPC) model has gained significant attention. However, most of distributed and parallel graph algorithms in the MPC model are designed for static ...