%0 Journal Article
%T An Algorithm Computing the Maximum Clique in a Graph<br>求解图的最大团的一种算法
%A ZHONG Sheng
%A XIE Li
%A <br>仲盛
%A 谢立
%J 软件学报
%D 1999
%I 
%X The maximum clique problem is a wellknown NPcomplete problem. Previous algorithms are either applicable only to some particular graphs or in need of exponential time cost. In this paper, an algorithm is presented, which computes the maximum clique(s) based on the notion of interval representation of a graph. It can be applied to any simple graph and only needs polynomial time under the certain conditions.
%K Graph theory
%K graph theory algorithms
%K computability
%K NPproblem
%K clique<br>图论
%K 图论算法
%K 可计算性
%K NP问题
%K 集团
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=224C7B02D1F329A285DB2E1B1B52B537&yid=B914830F5B1D1078&vid=F3090AE9B60B7ED1&iid=38B194292C032A66&sid=334C61CAF4C8EF4E&eid=8BB50A069C48D50B&journal_id=1000-9825&journal_name=软件学报&referenced_num=6&reference_num=15