共 50 条
A New Spectral Bound on the Clique Number of Graphs
被引:0
|作者:
Bulo, Samuel Rota
[1
]
Pelillo, Marcello
[1
]
机构:
[1] Univ Venice, Dipartimento Informat, I-30123 Venice, Italy
来源:
关键词:
MAXIMAL CLIQUES;
ISOMORPHISM;
RECOGNITION;
ORDER;
D O I:
暂无
中图分类号:
TP18 [人工智能理论];
学科分类号:
081104 ;
0812 ;
0835 ;
1405 ;
摘要:
Many computer vision and patter recognition problems are intimately related to the maximum clique problem. Due to the intractability of this problem, besides the development of heuristics, a research direction consists in trying to find good bounds on the clique number of graphs. This paper introduces a new spectral upper bound on the clique number of graphs, which is obtained by exploiting an invariance of a continuous characterization of the clique number of graphs introduced by Motzkin and Straus. Experimental results on random graphs show the superiority of our bounds over the standard literature.
引用
收藏
页码:680 / 689
页数:10
相关论文