Graph Reconfiguration: The process of transforming one valid solution of a graph problem into another by sequentially modifying elements while preserving prescribed constraints.

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

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

The unified framework helps integrate earlier work and leads to fresh insights; enables the design of more efficient algorithms for many problems; leads to new algorithms for others; and eases the ...

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

Graph Reconfiguration and Coloring Problems Publication Trend The graph below shows the total number of publications each year in Graph Reconfiguration and Coloring Problems.