Art
J-GLOBAL ID:200902217233752836   Reference number:03A0442224

An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning.

Hopfieldネットワーク学習を用いた最大クリーク用の効率的近似アルゴリズム
Author (3):
Material:
Volume: 15  Issue:Page: 1605-1619  Publication year: Jul. 2003 
JST Material Number: W0257A  ISSN: 0899-7667  Document type: Article
Country of issue: United States (USA)  Language: ENGLISH (EN)
Terms in the title (4):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page