首页 | 本学科首页   官方微博 | 高级检索  
     检索      


The Maximum Clique Problem for Permutation Hamming Graphs
Authors:Barta  János  Montemanni  Roberto
Institution:1.Dalle Molle Institute for Artificial Intelligence, IDSIA—USI/SUPSI, 6962, Lugano, Switzerland
;2.Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, 42122, Reggio Emilia, Italy
;
Abstract:Journal of Optimization Theory and Applications - This paper explores a new approach to reduce the maximum clique problem associated with permutation Hamming graphs to smaller clique problems. The...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号