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

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

On Tuesday the 3rd of October 2023, M.Sc. Manuel Cáceres defends his PhD thesis on Parameterized and Safe & Complete Graph Algorithms for Bioinformatics. The thesis is related to research done in the ...

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

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