Optimization Online


Applications of the inverse theta number in stable set problems

Miklos Ujvari(ujvarim***at***cs.elte.hu)

Abstract: Recently the author introduced a semidefinite upper bound on the square of the stability number of a graph, the inverse theta number, which is proved here 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.


Category 1: Combinatorial Optimization


Download: [PDF]

Entry Submitted: 03/23/2011
Entry Accepted: 03/23/2011
Entry Last Modified: 03/23/2011

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society