Mathematicians have long sought to develop algorithms that can compare any two graphs. In practice, many ...

The study of such graphs is called graph theory. Engineers need to find planarity in a graph when, for example, they are designing a computer chip without a crossed wire.

Graph data science is when you want to answer questions, not just with your data, but with the connections between your data points — that’s the 30-second explanation, according to Alicia Frame.

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

Which is why mathematicians, computer scientists and other researchers are increasingly focusing on ways to generalize graph theory — in its many guises — to explore higher-order phenomena.

A research team has developed a new technology that enables to process a large-scale graph algorithm without storing the graph in the main memory or on disks.

Dijkstra’s algorithm was long thought to be the most efficient way to find a graph’s best routes. Researchers have now proved that it’s “universally optimal.” ...

With a $9.2 million grant from Intelligence Advanced Research Projects Activity (IARPA), Prof. Andrew A. Chien will lead a team of University of Chicago computer science researchers building the ...

This article was originally published with the title “A Dinosaur Can Teach Us How to Do Better Science” in Scientific American Magazine Vol. 330 No. 2 (February 2024), p. 82 ...