AN O(20.304N) ALGORITHM FOR SOLVING MAXIMUM INDEPENDENT SET PROBLEM

被引：0
作者：
JIAN, T
机构：
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1986年 / 35卷 / 09期
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：847 / 851
页数：5
相关论文
共 9 条
[1]   AN ANALYSIS OF SOME GRAPH THEORETICAL CLUSTER TECHNIQUES [J].
AUGUSTSO.JG ;
MINKER, J .
JOURNAL OF THE ACM, 1970, 17 (04) :571-&
[2]  
BERMAN PR, COMMUNICATION
[3]   FINDING ALL CLIQUES OF AN UNDIRECTED GRAPH [H] [J].
BRON, C ;
KERBOSCH, J .
COMMUNICATIONS OF THE ACM, 1973, 16 (09) :575-577
[4]   CLIQUES OF A GRAPH - VARIATIONS ON BRON-KERBOSCH ALGORITHM [J].
JOHNSTON, HC .
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1976, 5 (03) :209-238
[5]   CORRECTIONS TO BIERSTONES ALGORITHM FOR GENERATING CLIQUES [J].
MULLIGAN, GD ;
CORNEIL, DG .
JOURNAL OF THE ACM, 1972, 19 (02) :244-&
[6]   A T=O(2N-2), S=O(2N-4) ALGORITHM FOR CERTAIN NP-COMPLETE PROBLEMS [J].
SCHROEPPEL, R ;
SHAMIR, A .
SIAM JOURNAL ON COMPUTING, 1981, 10 (03) :456-464
[7]  
TARJAN RE, 1972, 72123 CORN U DEP COM
[8]  
TARJAN RE, 1977, SIAM J COMPUT, V3, P537
[9]  
TSUKIYAMA S, 1977, SIAM J COMPUT, V16, P505
1