Phase transition in the maximum clique problem: the case of Erdos-Renyi graphs

Details Phase transition in the maximum clique problem: the case of Erdos-Renyi graphs Phase transition in the maximum clique problem: the case of Erdos-Renyi graphs

2007-07-19

arxiv.org/abs/0707.2853v2

Physics

Condensed Matter

Statistical Mechanics

About 12pages, 1 tables, 4 figures,

Scientific paper

A phase transition, like the one already found on Boolean satisfiability
problem by Kirkpatrick and Selman, is found on max clique problem on ER graphs.
Although number of the datapoints is limited, the transition seems to obey
finite size scaling. The transition also shows concentration of the graph
instances which need particularly large CPU time to solve.

Affiliated with

Also associated with

No associations

Rating

Phase transition in the maximum clique problem: the case of Erdos-Renyi graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Phase transition in the maximum clique problem: the case of Erdos-Renyi graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Phase transition in the maximum clique problem: the case of Erdos-Renyi graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-544829