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

This technique provides a way to divide graphs into independent sections. It was invented to facilitate “distributed” algorithms, in which computations run in parallel on different parts of a graph, ...

It’s often assumed that Dijkstra’s algorithm, or the A* graph traversal algorithm is used, but the reality is that although these pure graph theory algorithms are decidedly influential, they ...

His most recent research has focused on foundational programming abstractions and implementations for irregular parallel algorithms such as graph algorithms. Pingali is the CEO and co-founder of ...

Today Memgraph, the streaming graph application platform, announced Memgraph 2.0, the public launch of its source-available platform, making it easy f ...