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

Effective AML compliance requires accurately screening for sanctions, politically exposed persons (PEPs), and adverse media. Two algorithms: Jaro-Winkler and Levenshtein, often come up in discussions ...

The Esau-Williams algorithm is one of the best known heuristics for the capacitated minimum spanning tree problem. This paper describes a simple enhancement of this heuristic. On benchmark test ...

You are the benevolent ruler of The Republic of Graphistan, and you want to modernize the roads between cities—widening them, repaving them, turning them into superhighways. But it’s complicated. When ...

1 Statistics Research Division, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Bandung, Indonesia 2 Undergraduate Program in Mathematics, Faculty of Mathematics and Natural ...

Peter Shor didn’t set out to break the internet. But an algorithm he developed in the mid-1990s threatened to do just that. In a landmark paper, Shor showed how a hypothetical computer that exploited ...

In our project, we plan to parallelize minimum spanning tree algorithms by, first, parallelizing Kruskal’s algorithm and, then, parallelizing Boruvka’s algorithm. In implementing Kruskal’s algorithm, ...