Phys.org

Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effective

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

A social network graph partitioning algorithm based on double deep Q-Network

In recent years, with the rapid development of technologies such as mobile internet, the internet of things, social networks, and big data processing, various industries have begun to generate vast ...
Helsinki

Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice

On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...
Nature

Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set

arising from: Martin J. A. Schuetz et al. Nature Machine Intelligence https://doi.org/10.1038/s42256-022-00468-6 (2022). The recent work by Schuetz et al. 1 ...
Hackaday

graph theory

Like many of us, [Tim]’s seen online videos of circuit sculptures containing illuminated LED filaments. Unlike most of us, however, he went a step further by using graph theory to design glowing ...