Dynamic graph algorithms and data structures represent a vital research frontier in computer science, underpinning applications from network analysis to real-time system monitoring.

Graph analytics is a hot topic, but what does it mean? At the DC GraphTour, I learned the difference between graph queries, graph algorithms, and graph analytics. Next up: San Francisco GraphTour.

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

The PC-algorithm was shown to be a powerful method for estimating the equivalence class of a potentially very high-dimensional acyclic directed graph (DAG) with the corresponding Gaussian distribution ...

Graph database and analytics software company TigerGraph has expanded its data science library to more than 50 algorithms.

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.

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.

Our research is focused on graph algorithms, from both a theoretical perspective, and a practical perspective motivated by real-world problems in Bioinformatics, such as genome sequencing technologies ...

Published research demonstrates that reduced link graphs are an effective way to rank links. This article discusses research and patents that explain how reduced link graph algorithms work.