Graph algorithms and network analysis form the backbone of modern computational techniques used to decode the complex structures and dynamic behaviours exhibited by diverse real-world networks.

A professor has helped create a powerful new algorithm that uncovers hidden patterns in complex networks, with potential uses in fraud detection, biology and knowledge discovery.

University of Virginia School of Engineering and Applied Science professor Nikolaos Sidiropoulos has introduced a breakthrough in graph mining with the development of a new computational algorithm.

A new algorithm efficiently solves the graph isomorphism problem, which has puzzled computer scientists for decades.

Refining with colors Mathematicians have developed various strategies to compare graphs. Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time.

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on ...

In such cases, the fastest known shortest-path algorithm doesn’t work. For decades, fast algorithms for finding shortest paths on negative-weight graphs have remained elusive.

This is a preview. Log in through your library . Abstract We obtain a sharp result that for any even 𝑛 ≥ 34, every {𝐷𝑛, 𝐷𝑛+1}-regular graph of order 𝑛 contains [𝑛/4] disjoint perfect matchings, ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory.