arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0707.2853cond-mat.stat-mech
收藏

最大团问题中的相变:Erdos-Renyi图的情形

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

Kazuhito Shida

摘要:

在ER图的最大团问题上发现了一个相变,类似于Kirkpatrick和Selman在布尔可满足性问题上发现的相变。虽然数据点的数量是有限的,但这种转变似乎服从有限尺寸标度。转换还显示了需要特别大的CPU时间来求解的图实例的集中。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑