A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

Bisection problems, in particular, focus on the nearly equal division of a graph and are closely linked to studies in spectral graph theory and approximation algorithms. Research from Nature Portfolio ...

The graph below shows the total number of publications each year in Distributed Algorithms for Graph Problems. References [1] A distributed algorithm for vertex coloring problems in wireless networks.