Opening book details…
Can I read Bipartite Sandwiches: Semide?nite Relaxations for Maximum Biclique on EtoBox?
Bipartite Sandwiches: Semide?nite Relaxations for Maximum Biclique by Dmitrii V. Pasechnik is a Computer Science article available to read on EtoBox.
What is Bipartite Sandwiches: Semide?nite Relaxations for Maximum Biclique about?
A semidefinite relaxation for the maximum biclique problem for bipartite graphs is introduced and investigated. A "sandwich"-like inequalities on the maximum biclique number and optimal values of certain semidefinite programs (SDPs) are derived. Kronecker product of SDPs, a generalization of the tensor product of vector programs due to Lovász, is presented. It allows generalizing the celebrated formulae θ(Γ • ∆) = θ(Γ)θ(∆) for the Lovász theta function θ of the strong (co)product of graphs Γ and ∆ to larger classes of SDPs.
Who reads Bipartite Sandwiches: Semide?nite Relaxations for Maximum Biclique?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Dmitrii V. Pasechnik
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV; Amsterdam: Elsevier BV (ISSN 1571-0653)
- Published
- 1999
- Language
- EN
- Field
- Computer Science (Physical Sciences)