Abstract: The graph coloring problem involves coloring the nodes of a graph using the minimum number of colors such that no two adjacent nodes share the same color. This NP-hard problem has various ...

Abstract: The graph coloring problem is an important problem with many known applications, but it is not realistic to apply the exact algorithms to large graphs. Therefore, heuristics are used in many ...

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

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

An algorithm is a list of rules to follow in order to complete a task or solve a problem. The steps in an algorithm need to be in the right order. Think about an algorithm for getting dressed in the ...

One of the great episodes in the history of mathematics began on October 23, 1852. In a letter to Sir William Rowan Hamilton, Augustus De Morgan wrote, “A student of mine asked me today to give him a ...