Lovász theta function, SVMs and finding dense subgraphs (Q2933958)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6378062
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lovász theta function, SVMs and finding dense subgraphs |
scientific article; zbMATH DE number 6378062 |
Statements
8 December 2014
0 references
Lovász theta function
0 references
orthogonal labellings of graphs
0 references
planted cliques
0 references
random graphs
0 references
common dense subgraph
0 references
support vector machine
0 references
multiple kernel learning
0 references
0.7527303099632263
0 references
0.7275497913360596
0 references
0.7212114334106445
0 references
0.7202147841453552
0 references
