Graph algorithms and sparsification techniques have emerged as pivotal tools in the analysis and optimisation of complex networked systems. These approaches focus on reducing the number of edges in a ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

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

Estimating the number of triangles in a graph is a fundamental problem and has found applications in many fields. This ...