scientific article

From MaRDI portal

Revision as of 14:23, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2741360

Jump to:navigation, search

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 graph approximation Lovász theta function maximum biclique

Mathematics Subject Classification ID

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

Related Items (4)

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

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2741360&oldid=15606777"