Graph Reconfiguration and Coloring Problems Publication Trend The graph below shows the total number of publications each year in Graph Reconfiguration and Coloring 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 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 ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory.

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

Simulated annealing is a randomized technique proposed by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi for improving local optimization algorithms. Here we report on experiments at adapting simulated ...