Applications of the inverse theta number in stable set problems

Ujvári, Miklós: Applications of the inverse theta number in stable set problems. Acta cybernetica, (21) 3. pp. 481-494. (2014)

[img] Cikk, tanulmány, mű
actacyb_21_3_2014_12.pdf

Download (320kB)

Abstract

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.

Item Type: Article
Event Title: Symposium on Programming Languages and Software Tools, 13th, August 26-27, 2013, Szeged, Hungary
Journal or Publication Title: Acta cybernetica
Date: 2014
Volume: 21
Number: 3
Page Range: pp. 481-494
ISSN: 0324-721X
Language: angol
DOI: https://doi.org/10.14232/actacyb.21.3.2014.12
Uncontrolled Keywords: Informatika
Additional Information: Bibliogr.: 494. p. és a lábjegyzetekben
Date Deposited: 2016. Oct. 17. 10:37
Last Modified: 2018. Jun. 05. 15:44
URI: http://acta.bibl.u-szeged.hu/id/eprint/34480

Actions (login required)

View Item View Item