For instance, a study on maximum weight disjoint paths in outerplanar graphs has introduced single-tree cut approximators to yield constant-factor approximations for edge-disjoint paths [2].

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

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

The authors present, a new Parallel DBSCAN algorithm (PDSDBSCAN) using graph algorithmic concepts. More specifically, they employ the disjoint-set data structure to break the access sequentiality ...

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.

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.

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.

Where Graph Theory Meets The Road: The Algorithms Behind Route Planning 33 Comments by: Maya Posch April 4, 2024 ...