Q-partitioning of graphs with finite coordination number

Y. Y. Goldschmidt, P. -Y.lai

研究成果: 雜誌貢獻期刊論文同行評審

13 引文 斯高帕斯(Scopus)

摘要

The NP-complete optimisation problem of q-partitioning of graphs with finite connectivity is discussed. Using the effective local field method, the authors obtain the local field distributions with and without the continuous part and use them to calculate the ground-state energies of the three-state Potts spin glass on lattices with finite coordination number equal to three. This in turn gives analytic results for the optimal cost of the 3-partitioning of graphs. They perform simulations of actual 3-partitions of random graphs to compare with their theoretical results and obtain very good agreement. Ways for further improvement of the estimates are discussed.

原文???core.languages.en_GB???
文章編號001
頁(從 - 到)L1043-L1049
期刊Journal of Physics A: General Physics
21
發行號22
DOIs
出版狀態已出版 - 1988

指紋

深入研究「Q-partitioning of graphs with finite coordination number」主題。共同形成了獨特的指紋。

引用此