ON THE MAXIMUM WEIGHT CLIQUE PROBLEM

被引：26
作者：
BALAS, E
CHVATAL, V
NESETRIL, J
机构：
[1] MCGILL UNIV, MONTREAL H3A 2T5, QUEBEC, CANADA
[2] CHARLES UNIV, CS-11636 PRAGUE 1, CZECHOSLOVAKIA
来源：
MATHEMATICS OF OPERATIONS RESEARCH | 1987年 / 12卷 / 03期
关键词：
D O I：
10.1287/moor.12.3.522
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：522 / 535
页数：14
相关论文
共 30 条
[1]  
[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047
[2]   A FAST ALGORITHM FOR FINDING AN EDGE-MAXIMAL SUBGRAPH WITH A TR-FORMATIVE COLORING [J].
BALAS, E .
DISCRETE APPLIED MATHEMATICS, 1986, 15 (2-3) :123-134
[3]   FINDING A MAXIMUM CLIQUE IN AN ARBITRARY GRAPH [J].
BALAS, E ;
YU, CS .
SIAM JOURNAL ON COMPUTING, 1986, 15 (04) :1054-1068
[4]  
Berge C., 1960, PUBL I STAT U PARIS, V9, P123
[5]   CERTAIN POLYTOPES ASSOCIATED WITH GRAPHS [J].
CHVATAL, V .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1975, 18 (02) :138-154
[6]   TAIL OF THE HYPERGEOMETRIC DISTRIBUTION [J].
CHVATAL, V .
DISCRETE MATHEMATICS, 1979, 25 (03) :285-287
[7]  
Chvatal V., 1983, LINEAR PROGRAMMING
[8]  
DESCARTES B, 1954, AM MATH MONTHLY, V61, P362
[9]  
Dirac Gabriel Andrew, 1961, ABH MATH SEM HAMBURG, V25, P71, DOI [DOI 10.1007/BF02992776, 10.1007/BF02992776]
[10]  
Erdos P., 1963, PUBL MATH-DEBRECEN, V10, P10
123