Relaxation in graph coloring and satisfiability problems

10/13/1998
by   Pontus Svenson, et al.
0

Using T=0 Monte Carlo simulation, we study the relaxation of graph coloring (K-COL) and satisfiability (K-SAT), two hard problems that have recently been shown to possess a phase transition in solvability as a parameter is varied. A change from exponentially fast to power law relaxation, and a transition to freezing behavior are found. These changes take place for smaller values of the parameter than the solvability transition. Results for the coloring problem for colorable and clustered graphs and for the fraction of persistent spins for satisfiability are also presented.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/22/2000

The SAT Phase Transition

Phase transition is an important feature of SAT problem. For random k-SA...
research
08/03/2023

Upper bounds on the 2-colorability threshold of random d-regular k-uniform hypergraphs for k≥ 3

For a large class of random constraint satisfaction problems (CSP), deep...
research
10/19/2017

On vertex coloring without monochromatic triangles

We study a certain relaxation of the classic vertex coloring problem, na...
research
08/26/2020

High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality

We develop the first parallel graph coloring heuristics with strong theo...
research
09/27/2020

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs

An equitable coloring of a graph G=(V,E) is a (proper) vertex-coloring o...
research
03/30/2013

Phase Transition and Network Structure in Realistic SAT Problems

A fundamental question in Computer Science is understanding when a speci...
research
02/20/2018

Using Automatic Generation of Relaxation Constraints to Improve the Preimage Attack on 39-step MD4

In this paper we construct preimage attack on the truncated variant of t...

Please sign up or login with your details

Forgot password? Click here to reset