TY - JOUR
AU - Miklós Ujvári
PY - 2014/01/01
Y2 - 2022/05/18
TI - Applications of the inverse theta number in stable set problems
JF - Acta Cybernetica
JA - Acta Cybern
VL - 21
IS - 3
SE - Regular articles
DO - 10.14232/actacyb.21.3.2014.12
UR - https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3856
AB - In the paper we introduce a semidefinite upper bound on the square of the stability number of a graph, the inverse theta number, which is proved to be multiplicative with respect to the strong graph product, hence to be an upper bound for the square of the Shannon capacity of the graph. We also describe a heuristic algorithm for the stable set problem based on semidefinite programming, Cholesky factorization, and eigenvector computation.
ER -