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


The maximum clique problem
Authors:Panos M. Pardalos  Jue Xue
Affiliation:(1) Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, 32611 Gainesville, FL, USA;(2) Graduate School of Management, Clark University, 950 Main Street, 01610 Worcester, MA, USA
Abstract:In this paper we present a survey of results concerning algorithms, complexity, and applications of the maximum clique problem. We discuss enumerative and exact algorithms, heuristics, and a variety of other proposed methods. An up to date bibliography on the maximum clique and related problems is also provided.
Keywords:Maximum clique problem  graph coloring  heuristics  algorithms  NP-hard  bibliography  survey
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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