本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：1998
摘要
A 蒙地卡羅 algorithm for partitioning graphs is presented. The algorithm is based on the self-organizing map, an unsupervised, competitive 神經 網絡. A mean-field analysis suggests that the complexity of the algorithm is at most is on the order of O(n(3)/\E), where n is the number of vertices of the graph, and \E\ the number of edges. This prediction is tested on a class of 隨機圖s. 縮放律 laws that deviate from the mean-field prediction are obtained. Although the origin of these 縮放律 laws is unclear, their consequences are discussed.
※ 此為已發表論文，全文需透過期刊付費取得