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

David S. Johnson, Cecilia R. Aragon, Lyle A. McGeoch, Catherine Schevon, Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and ...

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

A theoretical computer scientist has presented an algorithm that is being hailed as a breakthrough in mapping the obscure terrain of complexity theory, which explores how hard computational problems ...

Furthermore, now mathematicians are looking for algorithms to efficiently detect perfect graphs. Others are seeking methods to find the minimal coloring the strong perfect graph theorem has shown ...

A paper posted online last month has disproved a 53-year-old conjecture about the best way to assign colors to the nodes of a network. The paper shows, in a mere three pages, that there are better ...