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

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a public transportation network. Mathematicians have long sought to develop ...

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

BingoCGN employs cross-partition message quantization to summarize inter-partition message flow, which eliminates the need for irregular off-chip memory access and utilizes a fine-grained structured ...

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