Phase Transition in the Bandwidth Minimization Problem

Authors:
Nelson Rangel-Valdez;Jose Torres-Jimenez
Affiliations:
Information Technology Laboratory, CINVESTAV-Tamaulipas, Victoria Tamps., Mexico 87276;Information Technology Laboratory, CINVESTAV-Tamaulipas, Victoria Tamps., Mexico 87276
Venue:
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Year:
2009

Citing 11
Cited 0

The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete

SIAM Journal on Algebraic and Discrete Methods
Phase transitions in artificial intelligence systems

Artificial Intelligence
Finding exact solutions to the bandwidth minimization problem

Computing
Statistical mechanics perspective on the phase transition in vertex covering offinite-connectivity random graphs

Theoretical Computer Science - Phase transitions in combinatorial problems
Constructing an asymptotic phase transition in random binary constraint satisfaction problems

Theoretical Computer Science - Phase transitions in combinatorial problems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Reducing the bandwidth of sparse symmetric matrices

ACM '69 Proceedings of the 1969 24th national conference
Laying Out Sparse Graphs with Provably Minimum Bandwidth

INFORMS Journal on Computing
Generation of hard non-clausal random satisfiability problems

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Tabu search for SAT

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is known that some NP-Complete problems exhibit sharp phase transitions with respect to some order parameter. Moreover, a correlation between that critical behavior and the hardness of finding a solution exists in some of these problems. This paper shows experimental evidence about the existence of a critical behavior in the computational cost of solving the bandwidth minimization problem for graphs (BMPG). The experimental design involved the density of a graph as order parameter, 200000 random connected graphs of size 16 to 25 nodes, and a branch and bound algorithm taken from the literature. The results reveal a bimodal phase transition in the computational cost of solving the BMPG instances. This behavior was confirmed with the results obtained by metaheuristics that solve a known BMPG benchmark.