scientific article

zbMath1072.05578MaRDI QIDQ2741360

Dimitrii V. Pasechnik

Publication date: 23 September 2001

Full work available at URL: http://www.elsevier.nl/cas/tree/store/disc/free/endm/store/contents.htt?jrnl=disc&sctn=endm&mode=sub&vol=3

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

bipartite graphapproximationLovász theta functionmaximum biclique

Mathematics Subject Classification ID

Semidefinite programming (90C22) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Finding biclusters by random projections, The maximum edge biclique problem is NP-complete, A notion of cross-perfect bipartite graphs, Bicliques and eigenvalues