Estimating the number of triangles in a graph is a fundamental problem and has found applications in many fields. This problem has been widely studied in the context of graph stream processing.

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

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