Dynamic graph algorithms and data structures represent a vital research frontier in computer science, underpinning applications from network analysis to real-time system monitoring. These methods ...

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

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

Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. (January 15, 2017, update: On January 4, Babai retracted his claim that the new algorithm ...