The graph colouring problem, a classic NP-hard challenge, is central to many practical applications such as scheduling, resource allocation and network management. Recent advances have seen the ...

Graph coloring has been employed since the 1980s to efficiently compute sparse Jacobian and Hessian matrices using either finite differences or automatic differentiation. Several coloring problems ...

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

Consider an urn model where at each step one of q colors is sampled according to some probability distribution and a ball of that color is placed in an urn. The distribution of assigning balls to urns ...

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