Motif-based graph local clustering is a popular method for graph mining tasks due to its various applications, such as community detection, network optimization and graph learning. However, the ...

Researchers took one of the most popular clustering approaches in modern biology -- Markov Clustering algorithm -- and modified it to run efficiently and at scale on supercomputers. Their algorithm ...

Recently, Applied Mathematics graduate student Alec Dunton and his team won the Graph Challenge as a part of his summer internship at Lawrence Livermore National Laboratory. The GraphChallenge, as ...

Machine learning, task automation and robotics are already widely used in business. These and other AI technologies are about to multiply, and we look at how organizations can best take advantage of ...

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

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...

Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. (January 15, 2017, update: On January 4, Babai retracted his claim that the new algorithm ...